Iterative rounding and relaxation

MaRDI QIDQ2999657zbMATH OpenFDO

Authors Lap Chi Lau, Mohit Singh

Publication date 16 May 2011

zbMATH Keywords

degree bounded matroid problemJain's methodminimum bounded degree

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Iterative methods in combinatorial optimization
• Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
• A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
• Prize-collecting Steiner networks via iterative rounding

Cited in

(8)

• Iterated snap rounding
• A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
• Computing predecessor and successor in rounding to nearest
• Iterative methods in combinatorial optimization
• New developments in iterated rounding (invited talk)
• scientific article; zbMATH DE number 1757945 (Why is no real title available?)
• Computing and Combinatorics
• An iterative method for improving decimal calculations on computers

This page was built for publication: Iterative rounding and relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999657)