A polynomial time approximation scheme for the grade of service Steiner minimum tree problem
From MaRDI portal
Publication:1810876
DOI10.1023/A:1021298822593zbMath1046.90076WikidataQ60403001 ScholiaQ60403001MaRDI QIDQ1810876
Ionut Cardei, Mihaela Cardei, Xiao-Hua Jia, Joon-Mo Kim
Publication date: 9 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
This page was built for publication: A polynomial time approximation scheme for the grade of service Steiner minimum tree problem