scientific article; zbMATH DE number 4125195
From MaRDI portal
Publication:4205235
Recommendations
- The prize collecting traveling salesman problem
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem
Cited in
(34)- An additive bounding procedure for the asymmetric travelling salesman problem
- On symmetric subtour problems
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- Minimum directed 1-subtree relaxation for score orienteering problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Strong linear programming relaxations for the orienteering problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- 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
- A TABU search heuristic for the team orienteering problem
- On the core of traveling salesman games
- The vehicle routing-allocation problem: A unifying framework
- New lower bounds for the symmetric travelling salesman problem
- An exact algorithm for the capacitated shortest spanning arborescence
- Routing problems: A bibliography
- On the nucleolus of the basic vehicle routing game
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- Evolution-inspired local improvement algorithm solving orienteering problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- A note on relatives to the Held and Karp 1-tree problem
- Algorithms to solve exact prize collecting traveling salesman problem with objective function depending on a parameter
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- The prize collecting traveling salesman problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- The prize collecting traveling salesman problem: II. Polyhedral results
- A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem
- A stochastic integer programming approach to air traffic scheduling and operations
- 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
- Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Formulations and algorithms for the simple cycle problem
- Multi-objective route planning of an unmanned air vehicle in continuous terrain: an exact and an approximation algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205235)
