Integer programming approaches for minimum stabbing problems
Year of publication: |
2014
|
---|---|
Authors: | Piva, Breno ; Souza, Cid Carvalho 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 | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Scheduling a manufacturing process with restrictions on resource availability
Matta, Renato de, (2018)
-
Matheuristics : survey and synthesis
Boschetti, Marco A., (2023)
- More ...
-
Minimum stabbing rectangular partitions of rectilinear polygons
Piva, Breno, (2017)
-
A matheuristic for the firefighter problem on graphs
Ramos, Natanael, (2019)
-
A heuristic for the convex recoloring problem in graphs
Dantas, Ana Paula S., (2020)
- More ...