scientific article; zbMATH DE number 1187152
From MaRDI portal
Publication:3840359
zbMATH Open0910.90259MaRDI QIDQ3840359FDOQ3840359
Authors: Gerhard J. Woeginger, Russell Woodroofe, Alexander Barvinok, D. S. Johnson
Publication date: 19 April 1999
Title of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (35)
- Approximation of the double traveling salesman problem with multiple stacks
- Voronoi polytopes for polyhedral norms on lattices
- Rank functions of tropical matrices
- Algorithms – ESA 2004
- Approximability of the multiple stack TSP
- Elastic geometric shape matching for translations under the Manhattan norm
- Improved deterministic approximation algorithms for max TSP
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
- The lazy bureaucrat scheduling problem
- The geometric maximum traveling salesman problem
- Better approximations for max TSP
- The travelling salesman problem on permuted Monge matrices
- Truncated \(M\)-travelling salesman problem
- An approximation algorithm for the maximum traveling salesman problem
- Title not available (Why is that?)
- On the coincidence of the factor and Gondran-Minoux rank functions of matrices over a semiring
- Factoring a band matrix over a semiring
- Title not available (Why is that?)
- On tropical matrices of small factor rank
- Title not available (Why is that?)
- Improved approximation algorithms for metric MaxTSP
- An improved randomized approximation algorithm for Max TSP
- THE TSP AND THE SUM OF ITS MARGINAL VALUES
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP
- The complexity of tropical matrix factorization
- Detecting matrices of combinatorial rank three
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- A \(\frac78\)-approximation algorithm for metric Max TSP
- The maximum travelling salesman problem on symmetric Demidenko matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The monotonic diameter of traveling salesman polytopes
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
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 Q3840359)