Constrained shortest path tour problem : Branch-and-Price algorithm
Year of publication: |
2022
|
---|---|
Authors: | Martin, Sébastien ; Magnouche, Youcef ; Juvigny, Corentin ; Leguay, Jérémie |
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. 144.2022, p. 1-27
|
Subject: | Column generation | Complexity | Dantzig–Wolfe decomposition | Integer linear programming | Integral polytope | Shortest path tour | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem
Fajemisin, Adejuyigbe O., (2021)
-
Energy-efficient automated vertical farms
Delorme, Maxence, (2022)
-
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
Becker, Henrique, (2024)
- More ...
-
Computing bipath multicommodity flows with constraint programming-based branch-and-price-and-cut
Zhang, Jiachen, (2024)
-
Design of survivable networks with low connectivity requirements
Almathkour, Fatmah, (2025)
-
The changing nature of the school-to-work transition process in OECD countries
Quintini, Glenda, (2007)
- More ...