Integer programming approaches for minimum stabbing problems
Year of publication: |
2014
|
---|---|
Authors: | Piva, Breno ; Souza, Cid C. de ; Frota, Yuri ; Simonetti, Luidi |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 48.2014, 2, p. 211-233
|
Subject: | integer programming | Lagrangian relaxation | stabbing problems | branch-and-bound | branch-and-cut | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Coniglio, Stefano, (2022)
-
A branch-and-price algorithm for the Multiple Knapsack Problem
Lalonde, Olivier, (2021)
-
A branch-and-price algorithm for the multiple knapsack problem
Lalonde, Olivier, (2022)
- More ...
-
Minimum stabbing rectangular partitions of rectilinear polygons
Piva, Breno, (2017)
-
Polyhedral study of the maximum common induced subgraph problem
Piva, Breno, (2012)
-
Polyhedral study of the maximum common induced subgraph problem
Piva, Breno, (2012)
- More ...