Skip to search formSkip to main contentSkip to account menu

ILOG

ILOG was an international software company purchased and incorporated into IBM announced in January, 2009. It created enterprise software products… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
.NET FrameworkAI winterAdobe AIRBusiness rules engine

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems
Highly Cited
2012
Highly Cited
2012
A branch-and-cut procedure for the Udine Course Timetabling problem
A branch-and-cut procedure for the Udine Course Timetabling problem is described. Simple compact integer linear programming… 
Highly Cited
2010
Highly Cited
2010
Iterated greedy local search methods for unrelated parallel machine scheduling
Highly Cited
2009
Highly Cited
2009
A dispatching method for automated lifting vehicles in automated port container terminals
Highly Cited
2006
Highly Cited
2006
Truck dock assignment problem with operational time constraint within crossdocks
Highly Cited
2006
Highly Cited
2006
Forming part families by using genetic algorithm and designing machine cells under demand changes
Highly Cited
2004
Highly Cited
2004
A Constraint for Bin Packing
We introduce a constraint for one-dimensional bin packing. This constraint uses propagation rules incorporating knapsack-based… 
Highly Cited
2000
Highly Cited
2000
A Job-Shop Scheduling Model for the Single-Track Railway Scheduling Problem
The Single-Track Railway Scheduling Problem can be modelled as a special case of the Job-Shop Scheduling Problem. This can be… 
Highly Cited
1997
Highly Cited
1997
CASTING: a formally based software test generation method
We present CASTING, a computer assisted software test engineering method. The method, supported by a prototype tool, generates… 
Review
1996
Review
1996
Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling
Edge-finding bounding techniques are particular constraint propagation techniques which reason about the order in which several… 
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)