Pages that link to "Item:Q4745612"

The following pages link to Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem (Q4745612):

Displaying 33 items.

• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• Time-dependent routing problems: a review (Q342083) (← links)
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• The multiple-robot assembly plan problem (Q685191) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Convergent duality for the traveling salesman problem (Q1178716) (← links)
• An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
• A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (Q2862156) (← links)
• An integer programming approach for the time-dependent TSP (Q2883581) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints (Q6088117) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)