Pages that link to "Item:Q1388929"

The following pages link to A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929):

Displaying 41 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Time-dependent routing problems: a review (Q342083) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• Looking ahead with the pilot method (Q816423) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
• The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
• Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• (Q2861531) (← 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)
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)