Sciweavers

5214 search results - page 104 / 1043
» The Online Specialization Problem
Sort
View
ECAI
2008
Springer
13 years 10 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
EOR
2006
103views more  EOR 2006»
13 years 9 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
CCE
2007
13 years 9 months ago
Generate Pareto optimal solutions of scheduling problems using normal boundary intersection technique
The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that incorporates economic expectation, robustnes...
Zhenya Jia, Marianthi G. Ierapetritou
JGO
2008
98views more  JGO 2008»
13 years 9 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka
JCO
1998
97views more  JCO 1998»
13 years 8 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....