Sciweavers

8413 search results - page 17 / 1683
» Ordering Problem Subgoals
Sort
View
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
14 years 2 months ago
Evolutionary Approaches to Linear Ordering Problem
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...
Václav Snásel, Pavel Krömer, Ja...
CP
2001
Springer
14 years 11 days ago
Partially Ordered Constraint Optimization Problems
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...
Marco Gavanelli
AMC
2008
96views more  AMC 2008»
13 years 8 months ago
Existence result for impulsive third order periodic boundary value problems
Abstract. This paper is devoted to the study of periodic boundary value problems for nonlinear third order di
Zehour Benbouziane, Abdelkader Boucherif, Sidi Moh...
AMC
2008
106views more  AMC 2008»
13 years 8 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
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 ...
Miguel A. Salido
IOR
2008
102views more  IOR 2008»
13 years 7 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
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...
Alberto Ceselli, Giovanni Righini