Sciweavers

2864 search results - page 270 / 573
» Constraint Programming in OPL
Sort
View
CPAIOR
2010
Springer
15 years 10 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
ICFP
1997
ACM
15 years 9 months ago
A Practical Subtyping System For Erlang
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
Simon Marlow, Philip Wadler
CVPR
2009
IEEE
17 years 19 days ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
CADE
2009
Springer
16 years 6 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ICTAI
2007
IEEE
15 years 11 months ago
Strong Inverse Consistencies for Non-Binary CSPs
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
Kostas Stergiou