Pages that link to "Item:Q4519128"

The following pages link to A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128):

Displaying 37 items.

• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• An optimization approach for planning daily drayage operations (Q926343) (← links)
• Solving a school bus scheduling problem with integer programming (Q954937) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
• An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
• The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
• A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q2001859) (← links)
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← 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)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← 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)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)