Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1279.68108MaRDI QIDQ5900948

Gregory B. Sorkin, Alexander D. Scott

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05C85: Graph algorithms (graph-theoretic aspects)