The \(K\)-coverage concentrator location problem
type: Item
instance of: scholarly article
title: The \(K\)-coverage concentrator location problem
zbMATH Open document ID: 0756.90058
DOI: 10.1016/0307-904X(92)90086-I
author: Bala Shetty
author: Rathindra Sarathy
author: Arun Sen
published in: Applied Mathematical Modelling
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 62031
zbMATH Keywords: computer networks
zbMATH Keywords: \(K\)-coverage problem
zbMATH Keywords: centralized teleprocessing network
zbMATH Keywords: single-source capacitated warehouse location
zbMATH Keywords: subgradient algorithm
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
cites work: Large-Scale Network Topological Optimization
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
cites work: Q5566712
cites work: Q5591247
cites work: Validation of subgradient optimization
cites work: A generalization of Polyak's convergence result for subgradient optimization
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
full work available at URL: 0307-904x(92)90086-i
OpenAlex ID: W2060686653
description: scientific article; zbMATH DE number 62031