An overview on polynomial approximation of NP-hard problems
From MaRDI portal
Publication:3655024
DOI10.2298/YJOR0901003PzbMath1274.90005MaRDI QIDQ3655024
Publication date: 12 January 2010
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
Algorithmic analysis of priority-based bin packing ⋮ Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
This page was built for publication: An overview on polynomial approximation of NP-hard problems
