52 search results - page 1 / 11 » Computing with Domino-Parity Inequalities for the Traveling ... |
INFORMS
2007
13 years 4 months ago
2007
MOR
2010
13 years 3 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
WADS
2007
Springer
13 years 10 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...