Applying Lagrangian relaxation to the resolution of two-stage location problems
type: Item
instance of: scholarly article
title: Applying Lagrangian relaxation to the resolution of two-stage location problems
zbMATH Open document ID: 0921.90104
DOI: 10.1023/A:1018998500803
author: Alfredo Marín
author: B. Pelegrin
published in: Annals of Operations Research
publication date: 1999-06-10T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1299346
zbMATH Keywords: two-stage location problems
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: lower bounds
zbMATH Keywords: heuristic solutions
MaRDI profile type: Publication
full work available at URL: a:1018998500803
OpenAlex ID: W197064018
Recommended article: Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
Recommended article: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
Recommended article: Q4719356
Recommended article: Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
Recommended article: Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
Recommended article: An improved Lagrangian relaxation and dual ascent approach to facility location problems
Recommended article: An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
Recommended article: Q5411265
Recommended article: Solving the anti-covering location problem using Lagrangian relaxation
description: scientific article; zbMATH DE number 1299346