Sciweavers

177 search results - page 31 / 36
» Semidefinite Programming Relaxations for the Quadratic Assig...
Sort
View
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
16 years 3 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
SIAMREV
2010
174views more  SIAMREV 2010»
14 years 9 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 4 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
COR
2010
123views more  COR 2010»
15 years 3 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 2 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram