A Lagrangian heuristic for the capacitated plant location problem with single source constraints
From MaRDI portal
Publication:2367382
DOI10.1016/0377-2217(93)90219-DzbMath0771.90062MaRDI QIDQ2367382
Publication date: 30 September 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
heuristicbin packingcapacitated plant locationLagrangian relaxationsconcentrator locationsingle source constraints
Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Optimization of production allocation and transportation of customer orders for a leading forest products company, A branch-and-price algorithm for the capacitated facility location problem, An exact algorithm for the capacitated facility location problems with single sourcing, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Revisiting Lagrangian relaxation for network design, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Upper and lower bounds for the single source capacitated 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, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Fuzzy programming and profit and cost allocation for a production and transportation problem, Facility location models for distribution system design, Planning and coordination of production and distribution facilities for multiple commodities, Benders decomposition, Lagrangean relaxation and metaheuristic design, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, NAFTA supply chains: facilities location and logistics, A new extended formulation with valid inequalities for the capacitated concentrator location problem, A genetic algorithm for a single product network design model with lead time and safety stock considerations, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, An exact method for the two-echelon, single-source, capacitated facility location problem, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, A repeated matching heuristic for the single-source capacitated facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
- An algorithm for the solution of the 0-1 knapsack problem
- Lagrangean heuristics for location problems
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Multicommodity Distribution System Design by Benders Decomposition
- An Improved Algorithm for the Capacitated Facility Location Problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Validation of subgradient optimization
