New modeling approaches for the design of local access transport area networks
type: Item
instance of: scholarly article
title: New modeling approaches for the design of local access transport area networks
zbMATH Open document ID: 0991.90027
DOI: 10.1016/S0377-2217(99)00325-2
author: Hanif D. Sherali
author: Youngho Lee
author: Taehyung Park
published in: European Journal of Operational Research
publication date: 2000-12-21T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1548096
zbMATH Keywords: integer programming
zbMATH Keywords: reformulation-linearization technique
zbMATH Keywords: telecommunication networks
zbMATH Keywords: Lagrangian relaxations
MaRDI profile type: Publication
cites work: Capacitated facility location: Separation algorithms and computational experience
cites work: Capacitated Facility Location: Valid Inequalities and Facets
cites work: Models for planning capacity expansion in local access telecommunication networks
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: Large-Scale Network Topological Optimization
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Q4035361
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
cites work: Heuristics for the capacitated plant location model
cites work: Valid inequalities and facets of the capacitated plant location problem
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
cites work: Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
cites work: A variable target value method for nondifferentiable optimization
cites work: Design of survivable networks
full work available at URL: s0377-2217(99)00325-2
OpenAlex ID: W2022272248
description: scientific article; zbMATH DE number 1548096