Optimizing over the closure of rank inequalities with a small right-hand side for the maximum stable set problem via bilevel programming
Year of publication: |
2022
|
---|---|
Authors: | Coniglio, Stefano ; Gualandi, Stefano |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 1006-1023
|
Subject: | bilevel programming | branch-and-bound | branch-and-cut | cutting plane generation | integer programming | maximum stable set problem | rank inequalities | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Einkommensverteilung | Income distribution |
-
On the exact separation of cover inequalities of maximum depth
Catanzaro, Daniele, (2021)
-
Integer programming approaches for minimum stabbing problems
Piva, Breno, (2014)
-
Partial objective inequalities for the multi-item capacitated lot-sizing problem
Büyüktahtakın, İ. Esra, (2018)
- More ...
-
Coniglio, Stefano, (2021)
-
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
Amaldi, Edoardo, (2013)
-
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
Amaldi, Edoardo, (2013)
- More ...