Branch-and-refine for solving time-expanded MILP formulations
Fabian Gnegel, Armin Fügenschuh
| Year of publication: |
2023
|
|---|---|
| Authors: | Gnegel, Fabian ; Fügenschuh, Armin |
| 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. 149.2023, p. 1-15
|
| Subject: | Graph refinement | Branch-and-bound | Shortest path problem with time windows | Traveling salesman problem with time windows | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2022.106043 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013461062