one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...

In the multi-label text classification task, a usually corresponds to multiple label categories, and labels have correlation hierarchical structure. However, when hierarchy is unknown, number of various not balanced, which makes it difficult for model classify low-frequency labels. At same time, due existence similar labels, will be distinguish this paper, we propose based on multi-level constr...

In this paper, we propose a grouping based method to solve the stereo matching problem. We employ intensity segments on scan lines of stereo images as primitives for matching, and formulate the problem by introducing a multi-stage grouping process of the intensity segments. A relation that should be satisfied between a matching pair of intensity segments and Some constraints, including the self...

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

Constraint Handling Rules (CHR) is a committed-choice declarative language which has been originally designed for writing constraint solvers and which is nowadays a general purpose language. CHR programs consist of multi-headed guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached. Many empirical evidences suggest that multiple heads augment the expre...

This paper presents a unified framework for intra-view and inter-view constraint propagation on multi-view data. Pairwise constraint propagation has been studied extensively, where each pairwise constraint is defined over a pair of data points from a single view. In contrast, very little attention has been paid to inter-view constraint propagation, which is more challenging since each pairwise ...

In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...

We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evalu...