default search action
James H. Bookbinder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j17]Alia'a Al-Naggar, Fatma Gzara, James H. Bookbinder:
Distribution planning with random demand and recourse in a transshipment network. EURO J. Transp. Logist. 9(1): 100007 (2020)
2010 – 2019
- 2018
- [j16]Benhür Satir
, Fatih Safa Erenay
Shipment consolidation with two demand classes: Rationing the dispatch capacity. Eur. J. Oper. Res. 270(1): 171-184 (2018) - [j15]Tiffany Bayley
A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times. Int. J. Prod. Res. 56(3): 1326-1344 (2018) - 2017
- [j14]Samir Elhedhli, Zichao Li
Airfreight forwarding under system-wide and double discounts. EURO J. Transp. Logist. 6(2): 165-183 (2017) - 2015
- [j13]James H. Bookbinder, Samir Elhedhli, Zichao Li
The air-cargo consolidation problem with pivot weight: Models and solution methods. Comput. Oper. Res. 59: 22-32 (2015) - 2013
- [j12]Selvaprabu Nadarajah, James H. Bookbinder:
Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach. J. Heuristics 19(6): 917-942 (2013) - 2012
- [j11]M. Ali Ülkü
Optimal quoting of delivery time by a third party logistics provider: The impact of shipment consolidation and temporal pricing schemes. Eur. J. Oper. Res. 221(1): 110-117 (2012) - [j10]Ginger Y. Ke
The optimal quantity discount that a supplier should offer. J. Oper. Res. Soc. 63(3): 354-367 (2012)
2000 – 2009
- 2007
- [j9]Anne G. Robinson, James H. Bookbinder:
NAFTA supply chains: facilities location and logistics. Int. Trans. Oper. Res. 14(2): 179-199 (2007) - 2003
- [j8]Haldun Süral
The single-vehicle routing problem with unrestricted backhauls. Networks 41(3): 127-136 (2003)
1990 – 1999
- 1999
- [j7]Wendy W. Qu, James H. Bookbinder, Paul Iyogun:
An integrated inventory-transportation system with modified periodic policy for multiple products. Eur. J. Oper. Res. 115(2): 254-269 (1999) - [j6]James H. Bookbinder, Metin Çakanyildirim
Random lead times and expedited orders in (Q, r) inventory systems. Eur. J. Oper. Res. 115(2): 300-313 (1999) - 1998
- [j5]Louise P. Bertrand, James H. Bookbinder:
Stock redistribution in two-echelon logistics systems. J. Oper. Res. Soc. 49(9): 966-975 (1998) - 1995
- [j4]Abraham Grosfeld-Nir, James H. Bookbinder:
The planning of headways in urban public transit. Ann. Oper. Res. 60(1): 145-160 (1995) - [j3]James K. Higginson, James H. Bookbinder:
Markovian Decision Processes in Shipment Consolidation. Transp. Sci. 29(3): 242-255 (1995) - 1992
- [j2]James H. Bookbinder, Alain Désilets:
Transfer Optimization in a Transit Network. Transp. Sci. 26(2): 106-118 (1992) - 1990
- [j1]James H. Bookbinder, Steven H. Edwards:
School-bus routing for program scheduling. Comput. Oper. Res. 17(1): 79-94 (1990)
1980 – 1989
- 1984
- [c1]James H. Bookbinder:
Simulation vs. optimization in physical distribution planning. WSC 1984: 436-443
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: