Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...