Similar Search Results

Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Kubach, T.; Bortfeldt, Andreas; Gehring, Hermann - In: Central European journal of operations research : CEJOR … 17 (2009) 4, pp. 461-477

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

A parallel hybrid local search algorithm for the container loading problem

Mack, Daniel; Bortfeldt, Andreas; Gehring, Hermann - 2004

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

Zwei Heuristiken für Strip-packing-Probleme

Bortfeldt, Andreas; Gehring, Hermann - 1999

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

Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Kubach, Timo - 2006

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

C & P software for a cutting problem of a German wood panel manufacturer : a case study

Papke, Tracy - 2006

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

Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid

Bortfeldt, Andreas; Tilli, Thomas; Gehring, Hermann - 2009

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

Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid

Kubach, Timo Alexander; Bortfeldt, Andreas; Tilli, Thomas; … - 2009

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

Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints

Reil, Sebastian; Bortfeldt, Andreas; Mönch, Lars - In: European journal of operational research : EJOR 266 (2018) 3, pp. 877-894

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

Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban

Männel, Dirk; Bortfeldt, Andreas - In: European journal of operational research : EJOR 264 (2018) 1, pp. 119-137

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

The split delivery vehicle routing problem with three-dimensional loading constrains

Bortfeldt, Andreas; Yi, Junmin - 2018

The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e. a customer can be visited in...

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