Solving resource constrained shortest path problems with LP-based methods
Year of publication: |
September 2016
|
---|---|
Authors: | Horváth, Markó ; Kis, Tamás |
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. 73.2016, p. 150-164
|
Subject: | Resource constrained shortest path | Integer programming | Branch-and-cut | Primal heuristics | Combinatorial optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Ganzzahlige Optimierung | Scheduling-Verfahren | Scheduling problem |
-
Silva, Allyson, (2021)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
- More ...
-
Assembly planning by disjunctive programming and geometrical reasoning
Horváth, Markó, (2022)
-
Polyhedral results for position-based scheduling of chains on a single machine
Horváth, Markó, (2020)
-
Horváth, Markó, (2019)
- More ...