Solving multi-period interdiction via generalized Bender's decomposition
From MaRDI portal
Publication:2401773
DOI10.1007/s10255-017-0687-9zbMath1370.90155WikidataQ58226723 ScholiaQ58226723MaRDI QIDQ2401773
Alireza Ghaffari-Hadigheh, Maryam Soleimani-Alyar
Publication date: 5 September 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-017-0687-9
generalized Benders decomposition; mixed-integer nonlinear programming; bi-level programming; network interdiction
90C35: Programming involving graphs or networks
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
90B10: Deterministic network models in operations research