Algorithms - ESA 2003
From MaRDI portal
Publication:5897287
DOI10.1007/b13632zbMath1266.90188OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897287
René Weiskircher, Gunnar W. Klau, Ulrich Pferschy, Petra Mutzel, Ivana Ljubić
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
Approximating a class of combinatorial problems with rational objective function ⋮ A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ Solving the probabilistic profitable tour problem on a line ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Algorithmic expedients for the prize collecting Steiner tree problem ⋮ Complexity and approximation for traveling salesman problems with profits ⋮ An exact method for assortment optimization under the nested logit model ⋮ Variations of the prize‐collecting Steiner tree problem ⋮ A sixth bibliography of fractional programming ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems
This page was built for publication: Algorithms - ESA 2003
