Pages that link to "Item:Q5943078"

The following pages link to Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078):

Displaying 50 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Solving a school bus scheduling problem with integer programming (Q954937) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions (Q1725617) (← 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)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q2001859) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• An optimal data-splitting algorithm for aircraft sequencing on a single runway (Q2070768) (← links)
• The distributed Kolkata paise restaurant game (Q2091673) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)
• Routing optimization with time windows under uncertainty (Q2414906) (← links)
• Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← 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)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
• Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← 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)