scientific article; zbMATH DE number 3908167
From MaRDI portal
Publication:3686500
Recommendations
Cited in
(60)- Blocked branch-and-bound method
- Modified branch-and-bound method for solving a series of problems
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Submodularity and the traveling salesman problem
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem
- Branch-and-bound as a higher-order function
- The traveling salesman problem: An overview of exact and approximate algorithms
- Analysis of the Held-Karp lower bound for the asymmetric TSP
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Estimating the Held-Karp lower bound for the geometric TSP
- Heuristics for the flow line problem with setup costs
- Vehicle routing with split deliveries
- Scheduling in a sequence dependent setup environment with genetic search
- A note on the complexity of the asymmetric traveling salesman problem
- A new variant of a vehicle routing problem: Lower and upper bounds
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Resolution search and dynamic branch-and-bound
- On patching algorithms for random asymmetric travelling salesman problems
- Constrained spanning trees and the traveling salesman problem
- A new algorithm for the propositional satisfiability problem
- The traveling salesman problem with backhauls
- The multiagent planning problem
- Potential-based bounded-cost search and anytime non-parametric A*
- Predicting optimal solution cost with conditional probabilities
- A light-propagation model for aircraft trajectory planning
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Maxx: Test pattern optimisation with local search over an extended logic
- Exploiting relaxation in local search for LABS
- Tolerance-based branch and bound algorithms for the ATSP
- Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
- A study of complexity transitions on the asymmetric traveling salesman problem
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- About branch and bound method
- Branch-and-bound methods
- scientific article; zbMATH DE number 3861209 (Why is no real title available?)
- A branch and bound algorithm for traveling salesman problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
- Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
- scientific article; zbMATH DE number 646750 (Why is no real title available?)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
- Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
- Genetic algorithm for combinatorial path planning: the subtour problem
- Exact solution of two location problems via branch-and-bound
- scientific article; zbMATH DE number 4189104 (Why is no real title available?)
- Performance of linear-space search algorithms
- Performance of linear-space search algorithms
- Construction heuristics for the asymmetric TSP.
- Branch and cut methods for network optimization
- Iterative state-space reduction for flexible computation
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows
- Average-case analysis of best-first search in two representative directed acyclic graphs
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- On the relationship between ATSP and the cycle cover problem
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
- On the stochastic complexity of the asymmetric traveling salesman problem
- The traveling salesman problem. II: Exact methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686500)
