INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM

DOI10.15807/JORSJ.43.291MaRDI QIDQ4538182zbMATH OpenOpenAlexFDO

Authors Takayuki Shiina

Publication date 11 July 2002

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.43.291

zbMATH Keywords

branch-and-boundcomputational efficiencyconcentrator location problemfractional cutting plane algorithmgreedy algorithminteger programming

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Topological Design of Centralized Computer Networks
• Efficient algorithms for the capacitated concentrator location problem
• An Algorithm for the Design of Multitype Concentrator Networks
• scientific article; zbMATH DE number 758441
• Combined capacity planning and concentrator location in computer communications networks

Cited in

(10)

• The \(K\)-coverage concentrator location problem
• Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
• Concentrator location in telecommunications networks.
• A new extended formulation with valid inequalities for the capacitated concentrator location problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• On the capacitated concentrator location problem: a reformulation by discretization
• scientific article; zbMATH DE number 4201579 (Why is no real title available?)
• Combined capacity planning and concentrator location in computer communications networks
• Topological Design of Centralized Computer Networks
• Polyhedral analysis for concentrator location problems

This page was built for publication: INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM

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