scientific article; zbMATH DE number 3982913

MaRDI QIDQ3747232zbMATH OpenFDO

Authors O. A. Zablotskaya

Publication date 1984

zbMATH Keywords

integer linear programmingcompletely regular cutting-off algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3948005
• A comparison of algorithms for one class of totally regular truncations
• Fenchel Cutting Planes for Integer Programs
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
• A simple finite cutting plane algorithm for integer programs

Cited in

(2)

• A comparison of algorithms for one class of totally regular truncations
• scientific article; zbMATH DE number 3952496 (Why is no real title available?)

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