Pages that link to "Item:Q4392516"

The following pages link to A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (Q4392516):

Displaying 48 items.

• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Solving the asymmetric traveling purchaser problem (Q867540) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
• Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
• A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• The weighted arborescence constraint (Q2011589) (← links)
• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← links)
• A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
• A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
• Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
• A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
• A column generation model for a scheduling problem with maintenance constraints (Q2741258) (← links)
• The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks (Q3167617) (← links)
• Facets of the Asymmetric Traveling Salesman Polytope (Q3971736) (← links)
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem (Q3980516) (← links)
• SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES (Q4006123) (← links)
• A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
• (Q4801179) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops (Q6064160) (← links)
• A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location (Q6065845) (← links)
• The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)