A repeated matching heuristic for the single-source capacitated facility location problem
From MaRDI portal
Publication:1610126
DOI10.1016/S0377-2217(98)00045-9zbMath1009.90064OpenAlexW1983006026MaRDI QIDQ1610126
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00045-9
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (12)
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ A heuristic for BILP problems: the single source capacitated facility location problem ⋮ A review of congestion models in the location of facilities with immobile servers ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Resource planning and a depot location model for electric power restoration. ⋮ Scatter search for the single source capacitated facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
- On the use of optimal fractional matchings for solving the (integer) matching problem
- Efficient algorithms for the capacitated concentrator location problem
- Aircrew schedule generation using repeated matching
- Lagrangean heuristics for location problems
- A new heuristic for the fleet size and mix vehicle routing problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A shortest augmenting path method for solving minimal perfect matching problems
- Parallel Savings Based Heuristics for the Delivery Problem
- A Repeated Matching Heuristic for the Vehicle Routeing Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
This page was built for publication: A repeated matching heuristic for the single-source capacitated facility location problem
