PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
Improved bounds for vehicle routing solutions.

, , and . Discrete Optimization, 3 (4): 299-316 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. James Foster University of Stuttgart

B. Schlecht

Max B. Schäfer

Samuel James Tovey University of Stuttgart

Jun. -Prof. Carina Bringedal University of Stuttgart

Modeling and Analysis of Droplet Evaporation at the Interface of a Coupled Free-Flow-Porous Medium System, , and . Transport in porous media, 151 (15): 2745-2775 (2024)
 

Other publications of authors with the same name

Robust optimization with incremental recourse., and . CoRR, (2013)A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand., , , , and . Math. Oper. Res., 34 (3): 674-685 (2009)On the hardness of finding subsets with equal average., and . Inf. Process. Lett., 113 (13): 477-480 (2013)Faster Algorithms for the Shortest Path Problem, , , and . J. ACM, 37 (2): 213-223 (April 1990)Fast neighborhood search for the single machine total weighted tardiness problem., and . Oper. Res. Lett., 34 (1): 41-45 (2006)A faster algorithm for the single source shortest path problem with few distinct positive lengths., , , and . J. Discrete Algorithms, 8 (2): 189-198 (2010)epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems., , and . Discrete Optimization, 5 (2): 550-561 (2008)A survey of very large-scale neighborhood search techniques., , , and . Discrete Applied Mathematics, 123 (1-3): 75-102 (2002)Finding minimum-cost flows by double scaling., , , and . Math. Program., (1992)Creating very large scale neighborhoods out of smaller ones by compounding moves., , and . J. Heuristics, 12 (1-2): 115-140 (2006)