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