THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM

DOI10.15807/jorsj.34.152zbMath0747.90102OpenAlexW2145778119MaRDI QIDQ3991641

Hiroshi Kasugai, Mikio Kubo

Publication date: 28 June 1992

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.34.152

zbMATH Keywords

heuristicsLagrangean relaxationbranch-and-boundlower boundsdirected complete graphprecedence constrained traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Routing problems: A bibliography ⋮ Dynamic programming in the routing problem: decomposition variant ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ On symmetric subtour problems ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

This page was built for publication: THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM