scientific article; zbMATH DE number 4125195

zbMath0686.90029MaRDI QIDQ4205235

Matteo Fischetti, Paolo Toth

Publication date: 1988

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

zbMATH Keywords

branch and boundboundsassignment1-arborescencedisjunctive techniquesprize-collecting traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items (25)

Strong linear programming relaxations for the orienteering problem ⋮ A TSSP+1 decomposition strategy for the vehicle routing problem ⋮ An exact algorithm for the capacitated shortest spanning arborescence ⋮ Routing problems: A bibliography ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ On the nucleolus of the basic vehicle routing game ⋮ The vehicle routing problem with service level constraints ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Formulations for the orienteering problem with additional constraints ⋮ FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations ⋮ An additive bounding procedure for the asymmetric travelling salesman problem ⋮ On symmetric subtour problems ⋮ A TABU search heuristic for the team orienteering problem ⋮ A note on relatives to the Held and Karp 1-tree problem ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ On the core of traveling salesman games ⋮ The vehicle routing-allocation problem: A unifying framework ⋮ New lower bounds for the symmetric travelling salesman problem ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem

This page was built for publication: