Sciweavers

2752 search results - page 6 / 551
» Rounding to an Integral Program
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 11 days ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 8 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
FOCS
2006
IEEE
14 years 2 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
LATIN
2010
Springer
14 years 1 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
ANOR
2007
126views more  ANOR 2007»
13 years 8 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey