Layered graph approaches for combinatorial optimization problems
Year of publication: |
February 2019
|
---|---|
Authors: | Gouveia, Luis ; Leitner, Markus ; Ruthmair, Mario |
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. 102.2019, p. 22-38
|
Subject: | Layered graphs | Integer programming | Extended formulations | Reformulation techniques | Decomposition methods | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio, (2024)
-
A two-level solution approach for solving the generalized minimum spanning tree problem
Pop, Petrică C., (2018)
-
Improving set partitioning problem solutions by zooming around an improving direction
Zaghrouti, Abdelouahab, (2020)
- More ...
-
Gouveia, Luis, (2017)
-
Multi-depot routing with split deliveries : models and a branch-and-cut algorithm
Gouveia, Luis, (2023)
-
Exact approaches for network design problems with relays
Leitner, Markus, (2019)
- More ...