scientific article; zbMATH DE number 1769325

DOI<263::AID-NET3>3.0.CO;2-Q 10.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-QzbMath1002.90044MaRDI QIDQ4540081

Gilbert Laporte, Michel Gendreau, Frédéric Semet

Publication date: 21 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

The clustered orienteering problem, Locating median cycles in networks, A guided local search metaheuristic for the team orienteering problem, Integer programming formulations for the elementary shortest path problem, A two-stage approach to the orienteering problem with stochastic weights, Solving the orienteering problem with time windows via the pulse framework, The production routing problem: a review of formulations and solution algorithms, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Evolution-inspired local improvement algorithm solving orienteering problem, The orienteering problem with variable profits, An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, Coupling ant colony systems with strong local searches, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, The orienteering problem: a survey, A branch-and-cut approach for the distributed no-wait flowshop scheduling problem, Formulations for the orienteering problem with additional constraints, Solving the team orienteering problem with nonidentical agents: A Lagrangian approach, Clustered coverage orienteering problem of unmanned surface vehicles for water sampling, A revisited branch-and-cut algorithm for large-scale orienteering problems, Hybrid genetic algorithm for undirected traveling salesman problems with profits, A stabilized column generation scheme for the traveling salesman subtour problem, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Mixed-integer programming approaches for the time-constrained maximal covering routing problem, Attractive orienteering problem with proximity and timing interactions, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, The vehicle routing problem with profits and consistency constraints, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, A location-routing problem in glass recycling, A TABU search heuristic for the team orienteering problem, Analysis of the maximum level policy in a production-distribution system, A path relinking approach for the team orienteering problem, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A Tabu search algorithm for the probabilistic orienteering problem, A branch-and-cut algorithm for an assembly routing problem, A memetic algorithm for the orienteering problem with hotel selection, Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem, A branch-and-cut algorithm for the capacitated profitable tour problem, A tabu search heuristic for the undirected selective travelling salesman problem, A fast solution method for the time-dependent orienteering problem