Multicommodity flows and Benders decomposition for restricted continuous location problems
From MaRDI portal
Publication:1754155
DOI10.1016/j.ejor.2017.11.033zbMath1403.90495OpenAlexW2770687804WikidataQ59884083 ScholiaQ59884083MaRDI QIDQ1754155
Tolga Bektaş, Murat Oğuz, Julia A. Bennell
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/415728/1/Main.pdf
Related Items (5)
Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Complexity results on planar multifacility location problems with forbidden regions
Cites Work
- A note on two problems in connexion with graphs
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Stochastic network models for logistics planning in disaster relief
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Integrated airline scheduling
- The multi-facility location-allocation problem with polyhedral barriers
- Practical enhancements to the Magnanti-Wong method
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Partitioning procedures for solving mixed-variables programming problems
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Combinatorial algorithms for some 1-facility median problems in the plane
- Algebraic properties of location problems with one circular barrier.
- Optimal bin location and sequencing in printed circuit board assembly
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A reduction result for location problems with polyhedral barriers
This page was built for publication: Multicommodity flows and Benders decomposition for restricted continuous location problems
