Large-scale 0-1 linear programming on distributed workstations
From MaRDI portal
Recommendations
- Parallel solution of large-scale, block-angular linear programs
- A parallel interior point algorithm for linear programming on a network of transputers
- scientific article; zbMATH DE number 4053344
- A parallel integer linear programming algorithm
- Computational experience with parallel mixed integer programming in a distributed environment
Cites work
- scientific article; zbMATH DE number 3155895 (Why is no real title available?)
- scientific article; zbMATH DE number 4021822 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3756243 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3361648 (Why is no real title available?)
- A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- An introduction to parallelism in combinatorial optimization
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Anomalies in parallel branch-and-bound algorithms
- Branch-and-bound and parallel computation: A historical note
- Branch-and-cut approach to a variant of the traveling salesman problem
- Convex Analysis
- Convexity Cuts and Cut Search
- Covering, Packing and Knapsack Problems
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Integer Linear Programming: A Study in Computational Efficiency
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Outline of an algorithm for integer solutions to linear programs
- Performance of parallel branch-and-bound algorithms
- Solution of a large-scale traveling-salesman problem
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
Cited in
(14)- On the efficacy of distributed simplex algorithms for linear programming
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- Parallel solution of large-scale, block-angular linear programs
- A parallel interior point algorithm for linear programming on a network of transputers
- Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
- Parallel processing for difficult combinatorial optimization problems
- A parallel, linear programming-based heuristic for large-scale set partitioning problems
- Combinatorial optimization: current successes and directions for the future
- Parallel implementation of Newton's method for solving large scale linear programs
- Linear Programming on Cray Supercomputers
- Large-scale and distributed optimization. Contributions of the workshop, Lund, Sweden, June 14--16, 2017
- Building a parallel branch and bound library
- scientific article; zbMATH DE number 4053344 (Why is no real title available?)
- A distributed computation algorithm for solving portfolio problems with integer variables
This page was built for publication: Large-scale 0-1 linear programming on distributed workstations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750295)
