Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,554,474 papers from all fields of science
Search
Sign In
Create Free Account
ILOG
ILOG was an international software company purchased and incorporated into IBM announced in January, 2009. It created enterprise software products…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
.NET Framework
AI winter
Adobe AIR
Business rules engine
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Temporal linear relaxation in IBM ILOG CP Optimizer
Philippe Laborie
,
J. Rogerie
Journal of Scheduling
2014
Corpus ID: 34689304
IBM ILOG CP Optimizer is a constraint solver that implements a model-and-run paradigm. For scheduling problems, CP Optimizer…
Expand
2010
2010
Planning and scheduling teams of skilled workers
Laurent Perron
Journal of Intelligent Manufacturing
2010
Corpus ID: 3191427
Solving problems that mix planning and scheduling are often seen as a challenge. Discrete time-based scheduling, along with…
Expand
Review
2007
Review
2007
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
E. Burke
,
Jakub Marecek
,
A. Parkes
,
Hana Rudová
arXiv.org
2007
Corpus ID: 3264698
Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have…
Expand
2007
2007
Translation Wikified: how will massive online collaboration impact the world of translation?
Alain Désilets
TC
2007
Corpus ID: 29959072
Massively collaborative sites like Wikipedia, YouTube and SecondLife are revolutionizing the way in which content is produced and…
Expand
Review
2007
Review
2007
A supernodal formulation of vertex colouring with applications in course timetabling
E. Burke
,
Jakub Marecek
,
A. Parkes
,
Hana Rudová
Annals of Operations Research
2007
Corpus ID: 10487364
For many problems in scheduling and timetabling, the choice of a mathematical programming formulation is determined by the…
Expand
Highly Cited
2006
Highly Cited
2006
Forming part families by using genetic algorithm and designing machine cells under demand changes
Geonwook Jeon
,
H. Leep
Computers & Operations Research
2006
Corpus ID: 26511381
2004
2004
Trying Again to Fail-First
J. Christopher Beck
,
P. Prosser
,
R. Wallace
ERCIM Annual Workshop on Constraint Solving and…
2004
Corpus ID: 2583844
For constraint satisfaction problems (CSPs), Haralick & Elliott [1] introduced the Fail-First Principle and defined in it terms…
Expand
2004
2004
Using directed acyclic graphs to coordinate propagation and search for numerical constraint satisfaction problems
Xuan-Ha Vu
,
H. Schichl
,
Djamila Sam-Haroud
IEEE International Conference on Tools with…
2004
Corpus ID: 2107534
The paper of H. Schichl & A. Neumaier has given the fundamentals of interval analysis on DAGs for global optimization and…
Expand
2002
2002
UPGRADE: A Framework for Building Graph-Based Interactive Tools
Boris Böhlen
,
Dirk Jäger
,
A. Schleicher
,
B. Westfechtel
GraBaTs
2002
Corpus ID: 14811894
2001
2001
Rule-based Programming for Building Expert Systems: a Comparison in the Microbiological Data Validation and Surveillance Domain
E. Lamma
,
L. Maestrami
,
P. Mello
,
Fabrizio Riguzzi
,
S. Storari
RULE@PLI
2001
Corpus ID: 1614631
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE