Sciweavers

CORR
2012
Springer
204views Education» more  CORR 2012»
11 years 11 months ago
A Framework for Optimizing Paper Matching
At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge fo...
Laurent Charlin, Richard S. Zemel, Craig Boutilier
CORR
2012
Springer
185views Education» more  CORR 2012»
11 years 11 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
CVPR
2011
IEEE
12 years 12 months ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller
ICIP
2010
IEEE
13 years 1 months ago
An integer programming approach to visual compliance
Visual compliance has emerged as a new paradigm to ensure that employees comply with processes and policies in a business context [1]. In this paper, we focus on videos from retai...
Lei Ding, Quanfu Fan, Sharath Pankanti
MP
2002
95views more  MP 2002»
13 years 3 months ago
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....
Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeging...
MP
2006
121views more  MP 2006»
13 years 3 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
IPCO
2007
87views Optimization» more  IPCO 2007»
13 years 5 months ago
On Integer Programming and the Branch-Width of the Constraint Matrix
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
William H. Cunningham, Jim Geelen
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 5 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ATAL
2008
Springer
13 years 5 months ago
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
Andrea Giovannucci, Meritxell Vinyals, Juan A. Rod...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
13 years 10 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke