Pages that link to "Item:Q5928379"

The following pages link to Construction heuristics for the asymmetric TSP. (Q5928379):

Displaying 25 items.

• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Towards auction algorithms for large dense assignment problems (Q839685) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (Q864814) (← links)
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149) (← links)
• Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
• Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
• Extended neighborhood: Definition and characterization (Q1764249) (← links)
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
• Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (Q2070127) (← links)
• Solution of real-world postman problems (Q2482818) (← links)
• Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
• Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
• Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)
• Dominance rules for single machine schedule with sequence dependent setup and due date (Q5408963) (← links)
• Some dominance properties for single-machine tardiness problems with sequence-dependent setup (Q5485050) (← links)
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
• Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp¹ (Q6039443) (← links)