Iterative methods in combinatorial optimization

DOI10.4230/LIPICS.FSTTCS.2009.2339zbMATH Open1248.68565MaRDI QIDQ2920152FDOQ2920152

R. Ravi

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c667.html

Recommendations

• Iterative rounding and relaxation
• Iterative methods in combinatorial optimization.
• Iterative packing for demand and hypergraph matching
• A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
• On generalizations of network design problems with degree bounds

zbMATH Keywords

linear programmingcombinatorial optimizationassignment problemapproximation algorithmsiterative methodsnetwork design

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (3)

• Choice by iterative search
• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems

This page was built for publication: Iterative methods in combinatorial optimization

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