Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems

DOI10.1287/opre.25.5.741zbMath0387.90080OpenAlexW2139648082MaRDI QIDQ4168391

Robert Garfinkel

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.5.741

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Related Items (17)

On Eigenproblem for Circulant Matrices in Max-Algebra ⋮ Hamiltonian cycles in circulant digraphs with two stripes ⋮ Hamiltonian properties of Toeplitz graphs ⋮ The robustness of interval fuzzy matrices ⋮ A comparison of lower bounds for the symmetric circulant traveling salesman problem ⋮ The optimum execution order of queries in linear storage ⋮ Well-solved cases of the 2-peripatetic salesman problem ⋮ Efficiently solvable special cases of bottleneck travelling salesman problems ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ On Hamiltonian paths in distance graphs ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ Characterizing bipartite Toeplitz graphs ⋮ Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem ⋮ Long cycles and paths in distance graphs ⋮ Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem ⋮ On the powers of matrices in bottleneck/fuzzy algebra ⋮ New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

This page was built for publication: Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems