A heuristic lagrangean algorithm for the capacitated plant location problem

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

Cites work

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

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

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)