Pages that link to "Item:Q2884545"
From MaRDI portal
The following pages link to A hybrid exact algorithm for the TSPTW (Q2884545):
Displaying 35 items.
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- A theoretical framework for the TTA algorithm (Q2078703) (← 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)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time (Q2294298) (← 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)
- A learning based algorithm for drone routing (Q2669632) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
- New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO (Q2950522) (← links)
- CP-Based Local Branching (Q3523091) (← links)
- (Q5020990) (← links)
- Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
- (Q5697875) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm (Q6543093) (← links)