Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
From MaRDI portal
Publication:3596368
DOI10.1007/11496915_32zbMath1119.90356OpenAlexW1570551345MaRDI QIDQ3596368
Agustín Bompadre, James B. Orlin
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_32
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems ⋮ Constraint-based very large-scale neighborhood search ⋮ A large neighbourhood search approach to the multi-activity shift scheduling problem ⋮ A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
This page was built for publication: Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
