Experiments with parallel branch-and-bound algorithms for the set covering problem

DOI10.1016/0167-6377(93)90050-QzbMath0789.90056MaRDI QIDQ1316095

Russell A. Rushmeier, Nemhauser, George I.

Publication date: 26 June 1994

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationparallel processingset coveringbranch-and-bound algorithmssubgradient optimizationinteger optimizationparallel multi-task model

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel numerical computation (65Y05)

Related Items (4)

A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ Multivariate composite distributions for coefficients in synthetic optimization problems ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ Solving the non-unicost set covering problem by using cuckoo search and black hole optimization

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Large-scale 0-1 linear programming on distributed workstations
• An introduction to parallelism in combinatorial optimization
• Experiments with parallel algorithms for combinatorial problems
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Linear Programming on Cray Supercomputers
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Optimal set partitioning, matchings and lagrangian duality
• Parallel Numerical Optimization: Current Status and an Annotated Bibliography
• Set Partitioning: A survey
• Validation of subgradient optimization
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: Experiments with parallel branch-and-bound algorithms for the set covering problem