Sciweavers

673 search results - page 45 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
APJOR
2010
112views more  APJOR 2010»
13 years 7 months ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
CCE
2008
13 years 7 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
COR
2007
106views more  COR 2007»
13 years 7 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
CPAIOR
2009
Springer
14 years 2 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
IJCAI
2003
13 years 9 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...