scientific article
From MaRDI portal
Publication:2861509
zbMath1274.90465MaRDI QIDQ2861509
Thi Thu Thuy Nguyen, Viet Hung Nguyen
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001162
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
The multi-vehicle profitable pickup and delivery problem ⋮ Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests ⋮ FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio ⋮ Approximating the minimum tour cover of a digraph ⋮ Exact methods for solving the elementary shortest and longest path problems
Cites Work
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- A 2log2(n)-Approximation Algorithm for Directed Tour Cover
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- The prize collecting traveling salesman problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- On some connectivity properties of Eulerian graphs
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
This page was built for publication:
