scientific article; zbMATH DE number 3982913

zbMATH Open0607.90059MaRDI QIDQ3747232FDOQ3747232

Authors: O. A. Zablotskaya 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

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)

Cited In (2)

• A comparison of algorithms for one class of totally regular truncations
• Title not available (Why is that?)

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)