Pages that link to "Item:Q1076605"
From MaRDI portal
The following pages link to An introduction to parallelism in combinatorial optimization (Q1076605):
Displaying 21 items.
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Experiments with parallel algorithms for combinatorial problems (Q1095034) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Branch-and-bound and parallel computation: A historical note (Q1099088) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
- An efficient parallel logarithmic time algorithm for the channel routing problem (Q1201820) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition (Q1824389) (← links)
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata (Q1824394) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- (Q3349963) (← links)
- Parallel computer models and combinatorial algorithms (Q3777451) (← links)
- (Q4718793) (← links)
- Parallel Combinatorial Optimization with Decision Diagrams (Q5418742) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)