Network design with service requirements : scaling-up the size of solvable problems
Year of publication: |
2022
|
---|---|
Authors: | Gudapati, Naga V. C. ; Malaguti, Enrico ; Monaci, Michele |
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. 34.2022, 5, p. 2571-2582
|
Subject: | branch-and-cut-and-price algorithm | budget-constrained shortest path | labeling algorithm | multicommodity flow | network design | service requirements | Algorithmus | Algorithm | Theorie | Theory | Operations Research | Operations research | Tourenplanung | Vehicle routing problem |
-
Faldum, Stefan, (2024)
-
Speeding up Martins' algorithm for multiple objective shortest path problems
Demeyer, Sofie, (2013)
-
Computing bipath multicommodity flows with constraint programming-based branch-and-price-and-cut
Zhang, Jiachen, (2024)
- More ...
-
A Metaheuristic Approach for the Vertex Coloring Problem
Malaguti, Enrico, (2008)
-
Models and heuristic algorithms for a weighted vertex coloring problem
Malaguti, Enrico, (2009)
-
Models and heuristic algorithms for a weighted vertex coloring problem
Malaguti, Enrico, (2009)
- More ...