Parallel Graver basis extraction for nonlinear integer optimization
From MaRDI portal
Cites work
- A polynomial oracle-time algorithm for convex integer minimization
- Convex integer maximization via Graver bases
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1254272 (Why is no real title available?)
- scientific article; zbMATH DE number 1860733 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Nonlinear integer programming
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- QPLIB: a library of quadratic programming instances
- The quadratic Graver cone, quadratic integer minimization, and extensions
This page was built for publication: Parallel Graver basis extraction for nonlinear integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285899)