An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
Year of publication: |
2014
|
---|---|
Authors: | Côté, Jean-François ; Gendreau, Michel ; Potvin, Jean-Yves |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 62.2014, 5, p. 1126-1141
|
Subject: | two-dimensional packing | unloading constraints | vehicle routing | branch-and-cut | Packproblem | Packing problem | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
-
Silva, Allyson, (2021)
-
The split delivery vehicle routing problem with three-dimensional loading constrains
Bortfeldt, Andreas, (2018)
- More ...
-
An integer L-Shaped method for the static stochastic bicycle repositioning problem
Parada, Lucas, (2024)
-
The disaggregated integer L-shaped method for the stochastic vehicle routing problem
Parada, Lucas, (2023)
-
Service level requirements for real-life-sized bicycle sharing systems
Parada, Lucas, (2025)
- More ...