Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5710803
DOI10.1007/b104584zbMath1112.90376OpenAlexW4211210842MaRDI QIDQ5710803
Marcel Turkensteen, Gerard Sierksma, Boris I. Goldengorin
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104584
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Extending single tolerances to set tolerances ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function ⋮ Tolerance-based branch and bound algorithms for the ATSP ⋮ Lower tolerance-based branch and bound algorithms for the ATSP ⋮ Equivalent instances of the simple plant location problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
This page was built for publication: Graph-Theoretic Concepts in Computer Science
