Deriving compact extended formulations via LP-based sepatration techniques
Year of publication: |
2014
|
---|---|
Authors: | Lancia, Giuseppe ; Serafini, Paolo |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 12.2014, 3, p. 201-234
|
Subject: | Compact extendes formulations | Integer linear programming | Branch-and-cut | Branch-and-price | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, AgustÃn, (2017)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
- More ...
-
A set-covering approach with column generation for parsimony haplotyping
Lancia, Giuseppe, (2009)
-
A time-indexed LP-based approach for min-sum job-shop problems
Lancia, Giuseppe, (2011)
-
Compact Extended Linear Programming Models
Lancia, Giuseppe, (2018)
- More ...