A penalty branch-and-bound method for mixed binary linear complementarity problems
Year of publication: |
2022
|
---|---|
Authors: | De Santis, Marianna ; Vries, Sven de ; Schmidt, Martin ; Winkel, Lukas |
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, 6, p. 3117-3133
|
Subject: | mixed-integer programming | penalty methods | branch and bound | linear complementarity problems | mixed-integer linear complementarity problems | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
Fischetti, Matteo, (2013)
-
Improving strong branching by domain propagation
Gamrath, Gerald, (2014)
-
Naderi, Bahman, (2020)
- More ...
-
Feasibility Pump-Like Heuristics for Mixed Integer Problems
De Santis, Marianna, (2010)
-
Continuous reformulations for zero-one programming problems
De Santis, Marianna, (2010)
-
New concave penalty functions for improving the Feasibility Pump
De Santis, Marianna, (2010)
- More ...