Building a parallel branch and bound library

DOI10.1007/BFB0027123zbMATH Open1543.68431MaRDI QIDQ6560211FDOQ6560211

Authors: Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand LeCun, Thierry Mautor, Catherine Roucairol 

Publication date: 21 June 2024

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Cites Work

• QAPLIB-A quadratic assignment problem library
• Title not available (Why is that?)
• Self-adjusting binary search trees
• Priority Search Trees
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• The pairing heap: A new form of self-adjusting heap
• Concurrent manipulation of binary search trees
• Efficient locking for concurrent operations on B-trees
• Concurrent search and insertion in 2-3 trees
• A parallel integer linear programming algorithm
• Implementation and Analysis of Binomial Queue Algorithms
• Parallel heap: an optimal parallel priority queue
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Concurrent Search and Insertion in AVL Trees
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms
• Large-scale 0-1 linear programming on distributed workstations
• Parallel state-space search for a first solution with consistent linear speedups
• A new exact algorithm for the solution of quadratic assignment problems
• Title not available (Why is that?)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• Branch-and-bound as a higher-order function
• Title not available (Why is that?)

This page was built for publication: Building a parallel branch and bound library

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560211)