CORR
2012
Springer
12 years 8 months ago
2012
Springer
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...
CORR
2012
Springer
12 years 8 months ago
2012
Springer
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...
CVPR
2011
IEEE
13 years 9 months ago
2011
IEEE
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...
ICIP
2010
IEEE
13 years 10 months ago
2010
IEEE
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...
MP
2002
14 years 11 days ago
2002
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....
MP
2006
14 years 20 days ago
2006
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 ...
IPCO
2007
14 years 2 months ago
2007
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...
IPCO
2008
14 years 2 months ago
2008
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...
ATAL
2008
Springer
14 years 2 months ago
2008
Springer
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...
WEA
2010
Springer
14 years 7 months ago
2010
Springer
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 ...