Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
199 views158 votes15 years 5 months ago ECAI 2010»
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
139 views162 votes15 years 6 months ago AAAI 2000»
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
133 views139 votes15 years 9 months ago IWPC 2000»
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
190 views163 votes15 years 4 months ago ENTCS 2007»
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
197 views160 votes15 years 3 months ago PPSN 2010»
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
119 views140 votes15 years 6 months ago AAAI 2004»
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...