Preprocessing and cutting planes with conflict graphs
Year of publication: |
2021
|
---|---|
Authors: | Brito, Samuel Souza ; Santos, Haroldo Gambini |
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. 128.2021, p. 1-22
|
Subject: | Mixed-integer linear programming | Conflict graphs | Preprocessing | Cutting planes | Clique inequalities | Odd-cycle inequalities | Einkommensverteilung | Income distribution | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Strong bounds for resource constrained project scheduling : preprocessing and cutting planes
Araujo, Janniele A. S., (2020)
-
Two-machine flow shop problem with unit-time operations and conflict graph
Tellache, Nour El Houda, (2017)
-
Leitner, Markus, (2016)
- More ...
-
Strong bounds for resource constrained project scheduling : preprocessing and cutting planes
Araujo, Janniele A. S., (2020)
-
Optimal decision trees for the algorithm selection problem : integer programming based approaches
Vilas Boas, Matheus Guedes, (2019)
-
Late acceptance hill-climbing for high school timetabling
Fonseca, George H. G., (2016)
- More ...