A heuristic lagrangean algorithm for the capacitated plant location problem

DOI10.1016/0377-2217(84)90211-XzbMATH Open0544.90025WikidataQ58650931 ScholiaQ58650931MaRDI QIDQ797475FDOQ797475

Authors: N. E. Zubov 

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• The capacitated plant location problem
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints

zbMATH Keywords

heuristiclogisticsassignmentLagrangean relaxationcapacitated plant location problemdemand constraintsnon-splitting constraintsplant selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Cites Work

• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• Title not available (Why is that?)
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Multicommodity Distribution System Design by Benders Decomposition
• Title not available (Why is that?)
• An analysis of approximations for maximizing submodular set functions—I
• A branch and bound algorithm for the generalized assignment problem
• An Analysis of the Greedy Heuristic for Independence Systems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• A Survey of Lagrangean Techniques for Discrete Optimization
• Inverse Optimization: An Application to the Capacitated Plant Location Problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (52)

• Locating Satellite Yards in Forestry Operations
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• The vendor location problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• Capacitated facility location problem with general setup cost
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Facility location models for distribution system design
• Scatter search for the single source capacitated facility location problem
• Approximate solutions to large scale capacitated facility location problems
• An algorithm for solving large capacitated warehouse location problems
• An exact algorithm for the capacitated facility location problems with single sourcing
• Algorithms for a multi-level network optimization problem
• Heuristic methods and applications: A categorized survey
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• Solving a class of stochastic mixed-integer programs with branch and price
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Auxiliary tool allocation in flexible manufacturing systems
• Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
• Lagrangean heuristics for location problems
• A supervised learning-driven heuristic for solving the facility location and production planning problem
• Matheuristics: survey and synthesis
• Title not available (Why is that?)
• Efficient algorithms for the capacitated concentrator location problem
• Title not available (Why is that?)
• A dual RAMP algorithm for single source capacitated facility location problems
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• Upper and lower bounds for the single source capacitated 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
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
• A simulated annealing methodology to distribution network design and management
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
• Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
• A capacitated facility location problem with constrained backlogging probabilities
• The design of reverse distribution networks: Models and solution procedures
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• Observations on some heuristic methods for the capacitated facility location problem
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• An exact method for the two-echelon, single-source, capacitated facility location problem
• Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
• A Lagrangean heuristic for the facility location problem with staircase costs
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• The capacitated plant location problem with multiple facilities in the same site
• Locating concentrators in centralized computer networks

This page was built for publication: A heuristic lagrangean algorithm for the capacitated plant location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797475)