Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
Year of publication: |
2023
|
---|---|
Authors: | Gao, Mujin ; Chen, Yanru ; Li, Junheng ; Wahab, M. I. M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 157.2023, p. 1-14
|
Subject: | Two-dimensional vector packing problem | Time-windows | Hybrid method | Branch-and-price-and-cut | Adaptive large neighborhood search | Packproblem | Packing problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
-
Wang, Ting, (2022)
-
A branch-and-price algorithm for the two-dimensional vector packing problem
Wei, Lijun, (2020)
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
- More ...
-
Ongkunaruk, Pornthipa, (2015)
-
An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows
Zhu, Ziqiang, (2024)
-
Tiger woman on Wall Street : winning business strategies from Shanghai to New York and back
Li, Junheng, (2014)
- More ...