A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
From MaRDI portal
Publication:1695027
DOI10.1016/j.ejor.2017.04.032zbMath1380.90165OpenAlexW2240149037MaRDI QIDQ1695027
Jesse R. O'Hanley, Trung Hieu Tran, Maria Paola Scaparra
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/61407/51/HMEH_EJOR2017.pdf
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic for BILP problems: the single source capacitated facility location problem
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- A survey of very large-scale neighborhood search techniques
- Facility location models for distribution system design
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A cutting plane algorithm for the capacitated facility location problem
- Scatter search for the single source capacitated facility location problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- Efficient algorithms for the capacitated concentrator location problem
- Equilibrium traffic assignment for large scale transit networks
- An exact algorithm for the capacitated facility location problems with single sourcing
- Flows on hypergraphs
- Upper and lower bounds for the single source capacitated location problem.
- A repeated matching heuristic for the single-source capacitated facility location problem
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Directed hypergraphs and applications
- Lagrangean heuristics for location problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- The hypergraph assignment problem
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Swapping Applications in a Daily Airline Fleet Assignment
- Large-scale local search heuristics for the capacitated vertexp-center problem
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Location Science
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
