Pages that link to "Item:Q3342216"
From MaRDI portal
The following pages link to Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216):
Displaying 30 items.
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← 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)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Time-constrained Chinese postman problems (Q1886476) (← links)
- Routing problems: A bibliography (Q1908308) (← 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)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← 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)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints (Q3767114) (← links)
- Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- Implementation of a linear time algorithm for certain generalized traveling salesman problems (Q4645932) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← 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)
