Computing bipath multicommodity flows with constraint programming-based branch-and-price-and-cut
Year of publication: |
2024
|
---|---|
Authors: | Zhang, Jiachen ; Magnouche, Youcef ; Bauguion, Pierre ; Martin, Sébastien ; Beck, J. Christopher |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 6, p. 1634-1653
|
Subject: | branch-and-price-and-cut | constraint programming | multicommodity flow | network routing | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
New models and applications for railway timetabling
Polinder, Gert-Jaap, (2020)
-
Network design with service requirements : scaling-up the size of solvable problems
Gudapati, Naga V. C., (2022)
-
Combinatorial Optimization and Applications : A Tribute to Bernard Gendron
Crainic, Teodor Gabriel, (2024)
- More ...
-
Constrained shortest path tour problem : Branch-and-Price algorithm
Martin, Sébastien, (2022)
-
Design of survivable networks with low connectivity requirements
Almathkour, Fatmah, (2025)
-
Do stock prices follow random walk over day and night? : evidence from Chinese stock market
Wan, Xiaoyuan, (2024)
- More ...