Iterative methods in combinatorial optimization

DOI10.4230/LIPICS.FSTTCS.2009.2339MaRDI QIDQ2920152zbMATH OpenFDO

Authors R. Ravi

Publication date 24 October 2012

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

zbMATH Keywords

approximation algorithmsassignment problemcombinatorial optimizationiterative methodslinear programmingnetwork design

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
• Iterative rounding and relaxation
• Iterative methods in combinatorial optimization.
• New developments in iterated rounding (invited talk)
• Choice by iterative search

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)