A nonlinear approach to a class of combinatorial optimization problems
From MaRDI portal
Recommendations
Cited in
(11)- Potential reduction algorithms for structured combinatorial optimization problems
- A potential reduction approach to the frequency assignment problem
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- A linear-time transformation of linear inequalities into conjunctive normal form
- scientific article; zbMATH DE number 714501 (Why is no real title available?)
- scientific article; zbMATH DE number 1786132 (Why is no real title available?)
- scientific article; zbMATH DE number 205727 (Why is no real title available?)
- scientific article; zbMATH DE number 1857672 (Why is no real title available?)
- scientific article; zbMATH DE number 2118654 (Why is no real title available?)
- scientific article; zbMATH DE number 966391 (Why is no real title available?)
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
This page was built for publication: A nonlinear approach to a class of combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259026)