A randomized parallel branch-and-bound algorithm

DOI10.1007/BF02427853zbMath0668.68030OpenAlexW2095187311MaRDI QIDQ1118396

Virendra K. Janakiram, Ravi Mehrotra, Dharma P. Agrawal, Edward F. Gehringer

Publication date: 1988

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02427853

zbMATH Keywords

branch-and-bound algorithmrandomized algorithmsknapsackspeedupparallel deterministic algorithms

Mathematics Subject Classification ID

Stochastic programming (90C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A successful algorithm for solving directed Hamiltonian path problems
• Sorting by distributive partitioning
• Random Trees and the Analysis of Branch and Bound Procedures
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• The average complexity of depth-first search with backtracking and cutoff
• Reduction Algorithm for Zero-One Single Knapsack Problems
• A General Algorithm for One-Dimensional Knapsack Problems
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

This page was built for publication: A randomized parallel branch-and-bound algorithm