[HTML][HTML] A survey on bilevel optimization under uncertainty
Bilevel optimization is a very active field of applied mathematics. The main reason is that
bilevel optimization problems can serve as a powerful tool for modeling hierarchical …
bilevel optimization problems can serve as a powerful tool for modeling hierarchical …
Multi-level facility location problems
C Ortiz-Astorquiza, I Contreras, G Laporte - European Journal of …, 2018 - Elsevier
We conduct a comprehensive review on multi-level facility location problems which extend
several classical facility location problems and can be regarded as a subclass within the …
several classical facility location problems and can be regarded as a subclass within the …
[图书][B] Integer programming
LA Wolsey - 2020 - books.google.com
A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
Y Yang, Y Yin, D Wang, J Ignatius, TCE Cheng… - European Journal of …, 2023 - Elsevier
Humanitarian logistics often faces the challenge of dealing with uncertainties when
developing a rescue strategy in response to the occurrence of a disaster. We develop a …
developing a rescue strategy in response to the occurrence of a disaster. We develop a …
Shelter location and evacuation route assignment under uncertainty: A benders decomposition approach
Shelters are safe facilities that protect a population from possible damaging effects of a
disaster. For that reason, shelter location and traffic assignment decisions should be …
disaster. For that reason, shelter location and traffic assignment decisions should be …
A tailored Benders decomposition approach for last-mile delivery with autonomous robots
L Alfandari, I Ljubić, MDM da Silva - European Journal of Operational …, 2022 - Elsevier
This work addresses an operational problem of a logistics service provider that consists of
finding an optimal route for a vehicle carrying customer parcels from a central depot to …
finding an optimal route for a vehicle carrying customer parcels from a central depot to …
Benders decomposition for very large scale partial set covering and maximal covering location problems
Covering problems constitute a fundamental family of facility location problems. This paper
introduces a new exact algorithm for two important members of this family:(i) the maximal …
introduces a new exact algorithm for two important members of this family:(i) the maximal …
Integrated optimization of rolling stock allocation and train timetables for urban rail transit networks: A benders decomposition approach
We investigate the integrated optimization of rolling stock allocation and train timetables
(RATT) in an urban rail transit network with multiple connected lines and rolling stock …
(RATT) in an urban rail transit network with multiple connected lines and rolling stock …
Partial benders decomposition: general methodology and application to stochastic network design
Benders decomposition is a broadly used exact solution method for stochastic programs,
which has been increasingly applied to solve transportation and logistics planning problems …
which has been increasingly applied to solve transportation and logistics planning problems …
A b ranch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone
In this paper, we are interested in studying the traveling salesman problem with drone (TSP‐
D). Given a set of customers and a truck that is equipped with a single drone, the TSP‐D …
D). Given a set of customers and a truck that is equipped with a single drone, the TSP‐D …