Sciweavers

84 search results - page 4 / 17
» Global Constraints for Integer and Set Value Precedence
Sort
View
JAIR
2008
98views more  JAIR 2008»
14 years 9 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
CPAIOR
2004
Springer
15 years 3 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
CP
2007
Springer
15 years 3 months ago
Breaking Symmetry of Interchangeable Variables and Values
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. ...
MP
2010
128views more  MP 2010»
14 years 8 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
EACL
2009
ACL Anthology
14 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud