scientific article; zbMATH DE number 958053

MaRDI QIDQ5687572zbMATH OpenFDO

Authors V. N. Shevchenko

Publication date 16 December 1996

zbMATH Keywords

convex hullinteger linear programming

Mathematics Subject Classification ID

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

Cited in

(13)

• FPT-algorithms for some problems related to integer programming
• On lattice point counting in -modular polyhedra
• How to find the convex hull of all integer points in a polyhedron?
• The integer hull of a convex rational polytope
• The width and integer optimization on simplices with bounded minors of the constraint matrices
• scientific article; zbMATH DE number 3896667 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1110374 (Why is no real title available?)
• Characteristic polynomials of multi-index transportation problems
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
• On -modular integer linear problems in the canonical form and equivalent problems
• Totally -modular IPs with two non-zeros in most rows
• On the size of integer programs with bounded non-vanishing subdeterminants

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 Q5687572)