scientific article; zbMATH DE number 947471
From MaRDI portal
Publication:4715981
zbMath0858.90132MaRDI QIDQ4715981
Russ J. vander Wiel, Nikolaos V. Sahinidis
Publication date: 23 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (14)
An integer programming approach for the time-dependent TSP ⋮ The traveling salesman problem with time-dependent service times ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Time-dependent routing problems: a review ⋮ On path ranking in time-dependent graphs ⋮ The time dependent traveling salesman problem: polyhedra and algorithm ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ An enhanced lower bound for the time-dependent travelling salesman problem
This page was built for publication:
