INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM

DOI10.15807/jorsj.43.291zbMath0998.90057OpenAlexW2145185671MaRDI QIDQ4538182

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

integer programmingbranch-and-boundgreedy algorithmcomputational efficiencyconcentrator location problemfractional cutting plane algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem

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