Sciweavers

671 search results - page 6 / 135
» An Integer Programming Approach for Linear Programs with Pro...
Sort
View
ENDM
2010
115views more  ENDM 2010»
13 years 4 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
ACL
2009
13 years 5 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
André L. Martins, Noah A. Smith, Eric P. Xi...
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 7 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 8 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
IJCAI
1989
13 years 8 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih