scientific article; zbMATH DE number 1066875

MaRDI QIDQ4357799zbMATH OpenFDO

Authors Teodor Toadere

Publication date 28 September 1997

zbMATH Keywords

consistencypolynomial algorithmKhachiyan's algorithmdeep cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Fast and Deterministic Approximations for k-Cut.
• Fast and deterministic approximations for \(k\)-cut
• Towards Algorithmic Cut-Introduction
• Algorithmic applications of tree-cut width
• Algorithmic applications of tree-cut width
• Efficient Algorithms for the k Smallest Cuts Enumeration
• scientific article; zbMATH DE number 1003274
• Depth-optimized convexity cuts
• Computing cut-based hierarchical decompositions in almost linear time
• Approximation algorithms for minimum \(K\)-cut

Cited in

(3)

• scientific article; zbMATH DE number 4091176 (Why is no real title available?)
• scientific article; zbMATH DE number 3993296 (Why is no real title available?)
• A better first step for Khachlan's algorithm in linear programming

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