Pages that link to "Item:Q1588841"

The following pages link to A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841):

Displaying 34 items.

• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
• Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• Finding the shortest path with vertex constraint over large graphs (Q2325209) (← links)
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers (Q2350866) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems (Q2903985) (← links)
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• A sequential ordering problem in automotive paint shops (Q3159669) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM (Q3991641) (← links)
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (Q4392516) (← links)
• On extended formulations for the precedence constrained asymmetric traveling salesman problem (Q5487814) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
• Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning (Q6041315) (← links)
• A branch‐and‐dive heuristic for single vehicle snow removal (Q6092642) (← links)
• Precedence-constrained arborescences (Q6109804) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)