A dynamic reformulation heuristic for generalized interdiction problems
Year of publication: |
16 May 2018
|
---|---|
Authors: | Fischetti, Matteo ; Monaci, Michele ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 267.2018, 1 (16.5.), p. 40-51
|
Subject: | (O) Combinatorial optimization | Bilevel optimization | Interdiction problems | Mixed-integer programming | Heuristics | Theorie | Theory | Heuristik | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
-
Mathematical models and algorithms for a high school timetabling problem
Al-Yakoob, Salem M., (2015)
-
Models and a solution algorithm for planning transfer synchronization of bus timetables
Chu, James C., (2019)
- More ...
-
Interdiction games and monotonicity, with application to knapsack problems
Fischetti, Matteo, (2019)
-
A new general-purpose algorithm for mixed-integer bilevel linear programs
Fischetti, Matteo, (2017)
-
An exact method for binary fortification games
Leitner, Markus, (2023)
- More ...