A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
type: Item
instance of: scholarly article
title: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
zbMATH Open document ID: 0971.90043
DOI: 10.1016/S0377-2217(99)00300-8
author: Andreas Klose
published in: European Journal of Operational Research
publication date: 2001-11-06T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1525550
zbMATH Keywords: distribution
zbMATH Keywords: location
zbMATH Keywords: heuristics
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: cutting planes
describes a project that uses: CPLEX
describes a project that uses: ACCPM
MaRDI profile type: Publication
cites work: Capacitated facility location: Separation algorithms and computational experience
cites work: Reformulation of capacitated facility location problems: How redundant information can help
cites work: Capacitated Facility Location: Valid Inequalities and Facets
cites work: On the Two-Level Uncapacitated Facility Location Problem
cites work: An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
cites work: A heuristic lagrangean algorithm for the capacitated plant location problem
cites work: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
cites work: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
cites work: Lagrangean heuristics for location problems
cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
cites work: Some facets of the simple plant location polytope
cites work: A comparison of heuristics and relaxations for the capacitated plant location problem
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
cites work: Uncapacitated facility location: General solution procedure and computational experience
cites work: Q4178782
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Using central prices in the decomposition of linear programs
cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes
cites work: Q4320084
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: An LP-based heuristic for two-stage capacitated facility location problems
cites work: Q4040780
cites work: An Improved Algorithm for the Capacitated Facility Location Problem
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Approximate solutions to large scale capacitated facility location problems
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
cites work: The capacitated plant location problem
cites work: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
cites work: Q4354953
description: scientific article; zbMATH DE number 1525550