Upper and lower bounds for the single source capacitated location problem.
From MaRDI portal
Publication:1410616
DOI10.1016/S0377-2217(02)00829-9zbMath1053.90051MaRDI QIDQ1410616
Maria Eugénia Captivo, Maria João Cortinhal
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A study on the budget constrained facility location model considering inventory management cost ⋮ 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 branch-and-price algorithm for the capacitated facility location problem ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ The single period coverage facility location problem: Lagrangean heuristic and column generation approaches ⋮ Revisiting Lagrangian relaxation for network design ⋮ Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem ⋮ The capacitated mobile facility location problem ⋮ Scatter search for the single source capacitated facility location problem ⋮ Introduction of an underground waste container system-model and solution approaches ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ A hybrid firefly-genetic algorithm for the capacitated facility location problem ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Bounds for the single source modular capacitated plant location problem ⋮ A capacitated facility location problem with constrained backlogging probabilities ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ Capacitated location model with online demand pooling in a multi-channel supply chain ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ A multi-stage supply chain network design problem with in-house production and partial product outsourcing ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Lagrangean heuristics for location problems
- Future paths for integer programming and links to artificial intelligence
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Efficient solution of large scale, single-source, capacitated plant location problems
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- 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
- An Improved Algorithm for the Capacitated Facility Location Problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
