Sciweavers

1613 search results - page 129 / 323
» Model-Driven Constraint Engineering
Sort
View
145
Voted
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 9 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
106
Voted
FLAIRS
2008
15 years 6 months ago
Reasoning with Conditional Time-Intervals
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
Philippe Laborie, Jerome Rogerie
115
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
242
Voted
SBIA
2010
Springer
15 years 2 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
130
Voted
ENDM
2010
115views more  ENDM 2010»
15 years 1 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi