When the greedy algorithm fails
From MaRDI portal
Publication:2386197
DOI10.1016/j.disopt.2004.03.007zbMath1087.90059MaRDI QIDQ2386197
Anders Yeo, Gregory Gutin, Jörgen Bang-Jensen
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.007
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Data-driven reduced order modelling for patient-specific hemodynamics of coronary artery bypass grafts with physical and geometrical parameters, An auxiliary function method for global minimization in integer programming, The neighbor-net algorithm, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Greedy-type resistance of combinatorial problems, DNA paired fragment assembly using graph theory, A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery, Discrete optimization algorithms and problems of decision making in a fuzzy environment, Minimum number of below average triangles in a weighted complete graph, Algorithms of discrete optimization and their application to problems with fuzzy coefficients, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- TSP heuristics: domination analysis and complexity
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Domination analysis of some heuristics for the traveling salesman problem
- Anti-matroids
- The Traveling Salesman Problem with Distances One and Two
