Pages that link to "Item:Q3890444"

The following pages link to Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (Q3890444):

Displaying 50 items.

• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Block clustering with collapsed latent block models (Q746220) (← links)
• Darts and hoopla board design (Q834892) (← links)
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
• On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
• A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
• Methods for routing with time windows (Q1068008) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (Q1092923) (← links)
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
• Vehicle routing with full loads (Q1099072) (← links)
• An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
• The pickup and delivery problem with time windows (Q1179004) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• Travelling salesman problem tools for microcomputers (Q1184464) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• New edges not used in shortest tours of TSP (Q1291639) (← links)
• A heuristic solution to the warehouse location-routing problem (Q1331555) (← links)
• Discrete optimization in public rail transport (Q1365068) (← links)
• Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
• A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• Cluster analysis to minimize sequence dependent changeover times (Q1900258) (← links)
• Infinite mixtures of infinite factor analysers (Q2226717) (← links)
• An exact method for scheduling a yard crane (Q2256284) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
• Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups (Q2565776) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
• New Imperialist Competitive Algorithm to solve the travelling salesman problem (Q2855772) (← links)
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
• Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
• Iterative state-space reduction for flexible computation (Q5940821) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)