scientific article
From MaRDI portal
Publication:3795496
DOI<359::AID-NAV3220350305>3.0.CO;2-H 10.1002/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-HzbMath0649.90089MaRDI QIDQ3795496
Bruce L. Golden, Qiwen Wang, Li Liu
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Strong linear programming relaxations for the orienteering problem, The clustered orienteering problem, A guided local search metaheuristic for the team orienteering problem, Orienteering problem: a survey of recent variants, solution approaches and applications, Heuristic algorithms for visiting the customers in a rolling schedule environment, The multi-district team orienteering problem, A two-stage approach to the orienteering problem with stochastic weights, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Using artificial neural networks to solve the orienteering problem, Routing problems: A bibliography, Evolution-inspired local improvement algorithm solving orienteering problem, Coupling ant colony systems with strong local searches, The orienteering problem: a survey, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, A stabilized column generation scheme for the traveling salesman subtour problem, The selective travelling salesman problem, On symmetric subtour problems, A TABU search heuristic for the team orienteering problem, A path relinking approach for the team orienteering problem, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A fast and effective heuristic for the orienteering problem, Minimum directed 1-subtree relaxation for score orienteering problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem, The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm, A heuristic for the multiple tour maximum collection problem, A tabu search heuristic for the undirected selective travelling salesman problem
Cites Work
