Asymptotically exact polynomial algorithms in integer linear programming
From MaRDI portal
Publication:3358527
DOI10.1515/DMA.1991.1.2.171zbMATH Open0731.90055OpenAlexW2082437955MaRDI QIDQ3358527
Publication date: 1991
Published in: dma (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1991.1.2.171
Could not fetch data.
Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (6)
Large final polynomials from integer programming ⋮ Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4 ⋮ Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices ⋮ Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems ⋮ Title not available (Why is that?) ⋮ On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
This page was built for publication: Asymptotically exact polynomial algorithms in integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358527)
