The following pages link to (Q3686500):
Displaying 44 items.
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
- Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- The multiagent planning problem (Q2012788) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- A light-propagation model for aircraft trajectory planning (Q2392113) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Maxx: Test pattern optimisation with local search over an extended logic (Q2460257) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755) (← links)
- A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Iterative state-space reduction for flexible computation (Q5940821) (← links)
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
