Pages that link to "Item:Q3832349"
From MaRDI portal
The following pages link to The prize collecting traveling salesman problem (Q3832349):
Displaying 23 items.
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Solving Relaxation Orienteering Problem Using DCA-CUT (Q5356984) (← links)
- An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem (Q5387396) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
- Bumblebee visitation problem (Q5918762) (← links)
- Models for a Steiner ring network design problem with revenues (Q5943555) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)
- Making opportunity sales in attended home delivery (Q6068689) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)
- Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure (Q6160201) (← links)
- A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
- The hazardous orienteering problem (Q6179713) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)
- Approximation algorithm for prize-collecting vertex cover with fairness constraints (Q6646739) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
