An introduction to parallelism in combinatorial optimization
From MaRDI portal
Recommendations
- Solving combinatorial optimization problems in parallel: methods and techniques
- Parallel processing for difficult combinatorial optimization problems
- scientific article; zbMATH DE number 1382772
- Spectral Analysis of an Oscillating Thermoviscoelastic Plate in a Transverse Magnetic Field
- scientific article; zbMATH DE number 1302200
- scientific article; zbMATH DE number 3936932
- scientific article; zbMATH DE number 4131653
- scientific article; zbMATH DE number 52911
- scientific article; zbMATH DE number 1150245
- scientific article; zbMATH DE number 4037239
Cites work
- A note on two problems in connexion with graphs
- A parallel algorithm for constructing minimum spanning trees
- A universal interconnection pattern for parallel computers
- Alternation
- An observation on time-storage trade off
- An Optimal Solution for the Channel-Assignment Problem
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
- Anomalies in parallel branch-and-bound algorithms
- Binary Trees and Parallel Scheduling Algorithms
- Bounds to Complexities of Networks for Sorting and for Switching
- Branch-and-bound and parallel computation: A historical note
- Constructing a perfect matching is in random NC
- Dynamic programming and parallel computers
- scientific article; zbMATH DE number 3889284 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3926209 (Why is no real title available?)
- scientific article; zbMATH DE number 3555903 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- Linear programming is log-space hard for P
- Parallel Matrix and Graph Algorithms
- Parallel Processing with the Perfect Shuffle
- Parallel Scheduling Algorithms
- Reducibility by algebraic projections
- Scheduling with deadlines and loss functions
- The general problem solving algorithm and its implementation
- The maximum flow problem is log space complete for P
- The NP-completeness column: An ongoing guide
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Towards a complexity theory of synchronous parallel computation
- Ultracomputers
Cited in
(24)- Experiments with parallel algorithms for combinatorial problems
- Some parallel algorithms on interval graphs
- Branch-and-bound and parallel computation: A historical note
- Parallel circle-cover algorithms
- On efficient parallel computations for some dynamic programming problems
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- A model classifying algorithms as inherently sequential with applications to graph searching
- An efficient parallel logarithmic time algorithm for the channel routing problem
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- A polynomial approximation scheme for the subset sum problem
- Some thoughts on combinatorial optimisation
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- scientific article; zbMATH DE number 3889284 (Why is no real title available?)
- scientific article; zbMATH DE number 4201596 (Why is no real title available?)
- scientific article; zbMATH DE number 4039291 (Why is no real title available?)
- scientific article; zbMATH DE number 52911 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Parallel Combinatorial Optimization with Decision Diagrams
- Parallel algorithms on circular-arc graphs
- Some applications of combinatorial optimization in parallel computing
- Large-scale 0-1 linear programming on distributed workstations
- Parallel time and space upper-bounds for the subset-sum problem
This page was built for publication: An introduction to parallelism in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076605)