A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints

DOI10.2307/2582672zbMATH Open0588.90025OpenAlexW4252586089MaRDI QIDQ3716773FDOQ3716773

Authors: John G. Klincewicz, Hanan Luss 

Publication date: 1986

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582672

Recommendations

• An exact algorithm for the capacitated facility location problems with single sourcing
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
• scientific article; zbMATH DE number 1187081
• Approximate solutions to large scale capacitated facility location problems
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints

zbMATH Keywords

Computational resultscapacitated problemsFacility location modelsLagrangian relaxation heuristic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Cited In (65)

• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
• Locating Satellite Yards in Forestry Operations
• On single-source capacitated facility location with cost and fairness objectives
• On the resolution of the single product capacitated machine siting problem
• An integrated approach for planning the adoption of client/server systems
• A heuristic approach to the single facility maximin location problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• The vendor location problem
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Facility location models for distribution system design
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
• Scatter search for the single source capacitated facility location problem
• A genetic algorithm for a single product network design model with lead time and safety stock considerations
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
• Approximate solutions to large scale capacitated facility location problems
• An exact algorithm for the capacitated facility location problems with single sourcing
• On the exact solution of large-scale simple plant location problems
• Heuristic methods and applications: A categorized survey
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• Title not available (Why is that?)
• A feasibility-ensured Lagrangian heuristic for general decomposable problems
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
• A heuristic for BILP problems: the single source capacitated facility location problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Auxiliary tool allocation in flexible manufacturing systems
• Lagrangean heuristics for location problems
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• Efficient algorithms for the capacitated concentrator location problem
• A dual RAMP algorithm for single source capacitated facility location problems
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• 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
• The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
• A Lagrangian heuristic algorithm for a public healthcare facility location problem
• 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
• Planning and coordination of production and distribution facilities for multiple commodities
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
• NAFTA supply chains: facilities location and logistics
• 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 LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS
• 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
• The \(K\)-coverage concentrator location problem
• Sequential location of two facilities: comparing random to optimal location of the first facility
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Near-optimal solutions to large-scale facility location problems
• An improved Lagrangian relaxation and dual ascent approach to facility location problems
• A Lagrangean heuristic for a modular capacitated location problem
• 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 Heuristic Procedure For Path Location With Multisource Demand
• Efficient solution of large scale, single-source, capacitated plant location problems
• A Lagrangean heuristic for the facility location problem with staircase costs
• Locating concentrators in centralized computer networks

This page was built for publication: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints

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