Pages that link to "Item:Q4849335"
From MaRDI portal
The following pages link to An Optimal Algorithm for the Traveling Salesman Problem with Time Windows (Q4849335):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- 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)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← 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)
- Traveling salesman problem with clustering (Q616229) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← 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)
- The rural postman problem with deadline classes (Q1291753) (← links)
- A soft dynamic programming approach for on-line aircraft 4D-trajectory optimization (Q1296062) (← links)
- Single-vehicle scheduling with time window constraints (Q1297696) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation (Q1754264) (← links)
- Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← 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)
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
- Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- Optimizing Time Slot Allocation in Single Operator Home Delivery Problems (Q2806900) (← links)
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
