scientific article; zbMATH DE number 1110374

zbMath0947.90076MaRDI QIDQ4374992

V. N. Shevchenko

Publication date: 26 January 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingconvex hullknapsack probleminteger linear programmingcutting methodsquasi-polynomial algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (8)

Independent sets in graphs without subtrees with many leaves ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ Representation of numbers by linear forms ⋮ Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations ⋮ Approximation of convex sets by polytopes ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ Frobenius problem for three arguments

This page was built for publication: