Large-scale 0-1 linear programming on distributed workstations
From MaRDI portal
Publication:750295
DOI10.1007/BF02023053zbMath0713.90052OpenAlexW1994230528MaRDI QIDQ750295
Timothy L. Cannon, Karla L. Hoffman
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023053
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Related Items (5)
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Experiments with parallel branch-and-bound algorithms for the set covering problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- An introduction to parallelism in combinatorial optimization
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Branch-and-bound and parallel computation: A historical note
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- Outline of an algorithm for integer solutions to linear programs
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Performance of parallel branch-and-bound algorithms
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Anomalies in parallel branch-and-bound algorithms
- Branch-and-cut approach to a variant of the traveling salesman problem
- Covering, Packing and Knapsack Problems
- Integer Linear Programming: A Study in Computational Efficiency
- Convex Analysis
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
- Convexity Cuts and Cut Search
This page was built for publication: Large-scale 0-1 linear programming on distributed workstations
