A heuristic lagrangean algorithm for the capacitated plant location problem
From MaRDI portal
Publication:797475
DOI10.1016/0377-2217(84)90211-XzbMath0544.90025WikidataQ58650931 ScholiaQ58650931MaRDI QIDQ797475
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Lagrangean relaxationheuristicassignmentlogisticscapacitated plant location problemdemand constraintsnon-splitting constraintsplant selection
Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items
A Lagrangian heuristic for the capacitated plant location problem with single source constraints, A cross decomposition algorithm for a multiproduct-multitype facility location problem, Efficient algorithms for the capacitated concentrator location problem, An algorithm for solving large capacitated warehouse location problems, A two-phase hybrid heuristic algorithm for the capacitated location-routing 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, Matheuristics: survey and synthesis, Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation, The design of reverse distribution networks: Models and solution procedures, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Locating Satellite Yards in Forestry Operations, 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., Approximate solutions to large scale capacitated facility location problems, Scatter search for the single source capacitated facility location problem, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, Observations on some heuristic methods for the capacitated facility location problem, A dual RAMP algorithm for single source capacitated facility location problems, Locating concentrators in centralized computer networks, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, The vendor location problem, A capacitated facility location problem with constrained backlogging probabilities, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Facility location models for distribution system design, Capacitated facility location problem with general setup cost, Benders decomposition, Lagrangean relaxation and metaheuristic design, Solving a class of stochastic mixed-integer programs with branch and price, Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach, Lagrangean heuristics for location problems, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, Auxiliary tool allocation in flexible manufacturing systems, Heuristic methods and applications: A categorized survey, 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, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, Algorithms for a multi-level network optimization problem, A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, A simulated annealing methodology to distribution network design and management, A repeated matching heuristic for the single-source capacitated facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- 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
- A branch and bound algorithm for the generalized assignment problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- An Analysis of the Greedy Heuristic for Independence Systems
- A Survey of Lagrangean Techniques for Discrete Optimization
