Similar Search Results

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading

Cherkesly, Marilène; Desaulniers, Guy; Laporte, Gilbert - In: Transportation science : a journal of the Institute for … 49 (2015) 4, pp. 752-766

Persistent link: https://www.econbiz.de/10011397855

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

Cherkesly, Marilène; Desaulniers, Guy; Laporte, Gilbert - In: Computers & operations research : and their … 62 (2015), pp. 23-35

Persistent link: https://www.econbiz.de/10011334008

The pickup and delivery problem with time windows, multiple stacks, and handling operations

Cherkesly, Marilène; Gschwind, Timo - In: European journal of operational research : EJOR 301 (2022) 2, pp. 647-666

Persistent link: https://www.econbiz.de/10013207669

The distance constrained multiple vehicle traveling purchaser problem

Bianchessi, N.; Mansini, Renata; Speranza, Maria Grazia - In: European journal of operational research : EJOR 235 (2014) 1, pp. 73-87

Persistent link: https://www.econbiz.de/10010361405

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Luo, Zhixing; Qin, Hu; Lim, Andrew - In: European journal of operational research : EJOR 234 (2014) 1, pp. 49-60

Persistent link: https://www.econbiz.de/10010247383

A network equilibrium analysis on destination, route and parking choices with mixed gasoline and electric vehicular flows

Jiang, Nan; Xie, Chi; Duthie, Jennifer C.; Waller, S. Travis - In: EURO journal on transportation and logistics 3 (2014) 1, pp. 55-92

Persistent link: https://www.econbiz.de/10010374430

Algorithms for the two dimensional bin packing problem with partial conflicts

Hamdi-Dhaoui, Khaoula; Labadie, Nacima; Yalaoui, Alice - In: RAIRO / Operations research 46 (2012) 1, pp. 41-62

Persistent link: https://www.econbiz.de/10010222604

Polynomial programming prevents aircraft (and other) conflicts

Cerulli, Martina; Liberti, Leo - In: Operations research letters 49 (2021) 4, pp. 447-451

Persistent link: https://www.econbiz.de/10012649004

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem

Gouveia, Luis; Leitner, Markus; Ruthmair, Mario - In: European journal of operational research : EJOR 262 (2017) 3, pp. 908-928

Persistent link: https://www.econbiz.de/10011802301

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Luo, Zhixing; Qin, Hu; Lim, Andrew - In: European Journal of Operational Research 234 (2014) 1, pp. 49-60

In this paper, we extend the multiple traveling repairman problem by considering a limitation on the total distance that a vehicle can travel; the resulting problem is called the multiple traveling repairmen problem with distance constraints (MTRPD). In the MTRPD, a fleet of identical vehicles...

Persistent link: https://www.econbiz.de/10010871175