Iterative rounding and relaxation
From MaRDI portal
Publication:2999657
zbMATH Open1223.90054MaRDI QIDQ2999657FDOQ2999657
Authors: Lap Chi Lau, Mohit Singh
Publication date: 16 May 2011
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (8)
- Iterated snap rounding
- Title not available (Why is that?)
- Iterative methods in combinatorial optimization
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
- Computing and Combinatorics
- An iterative method for improving decimal calculations on computers
- Computing predecessor and successor in rounding to nearest
- New developments in iterated rounding (invited talk)
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)