scientific article; zbMATH DE number 4181141
From MaRDI portal
Publication:3204331
zbMATH Open0716.90081MaRDI QIDQ3204331FDOQ3204331
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- Asymptotically exact polynomial algorithms in integer linear programming
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Polynomial algorithms for linear programming over the algebraic numbers
- scientific article; zbMATH DE number 4062814
- On the optimality of pseudo-polynomial algorithms for integer programming
- On the optimality of pseudo-polynomial algorithms for integer programming
- scientific article; zbMATH DE number 1161055
- scientific article; zbMATH DE number 4119927
- Polynomial affine algorithms for linear programming
- Polynomial approximations for continuous linear programs
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09)
Cited In (5)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
- Large final polynomials from integer programming
- Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204331)