Pages that link to "Item:Q3141769"

The following pages link to A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows (Q3141769):

Displaying 23 items.

• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
• A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (Q1278129) (← links)
• Single-vehicle scheduling with time window constraints (Q1297696) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
• Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)