Sciweavers

14 search results - page 2 / 3
» anor 2011
Sort
View
ANOR
2011
124views more  ANOR 2011»
13 years 24 days ago
Stochastic dominance of portfolio insurance strategies - OBPI versus CPPI
Abstract The purpose of this article is to analyze and compare two standard portfolio insurance methods: Option-based Portfolio Insurance (OBPI) and Constant Proportion Portfolio I...
Rudi Zagst, Julia Kraus
ANOR
2011
131views more  ANOR 2011»
13 years 24 days ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga
ANOR
2011
169views more  ANOR 2011»
12 years 9 months ago
Predetermined intervals for start times of activities in the stochastic project scheduling problem
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
Illana Bendavid, Boaz Golany
ANOR
2011
214views more  ANOR 2011»
13 years 24 days ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
ANOR
2011
96views more  ANOR 2011»
13 years 24 days ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder