Pages that link to "Item:Q1348379"

The following pages link to Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379):

Displaying 19 items.

• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem (Q367225) (← links)
• Greedy-type resistance of combinatorial problems (Q865746) (← links)
• Dominance guarantees for above-average solutions (Q937396) (← links)
• Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
• Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← links)
• Anti-matroids (Q1612010) (← links)
• On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
• The correlation of gene expression and co-regulated gene patterns in characteristic KEGG pathways (Q1722832) (← links)
• A meta-heuristic for capacitated green vehicle routing problem (Q1730494) (← links)
• A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery (Q2005557) (← links)
• Can the agent with limited information solve travelling salesman problem? (Q2012868) (← links)
• Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
• Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
• When the greedy algorithm fails (Q2386197) (← links)
• Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
• (Q3385394) (← links)