A combinatorial scheme for developing efficient composite solvers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4156211
- Optimisation techniques for combing constraint solvers
- scientific article; zbMATH DE number 780787
- Constraint-based analysis of composite solvers
- An integral simplex algorithm for solving combinatorial optimization problems
- A unified modeling and solution framework for combinatorial optimization problems
- Solving combinatorial optimization problems in parallel: methods and techniques
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Engineering a combinatorial Laplacian solver: lessons learned
- Flexible complementarity solvers for large-scale applications
Cited in
(4)- Engineering a combinatorial Laplacian solver: lessons learned
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- An evaluation of limited-memory sparse linear solvers for thermo-mechanical applications
- Enriching Solutions to Combinatorial Problems via Solution Engineering
This page was built for publication: A combinatorial scheme for developing efficient composite solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737755)