Sciweavers

14649 search results - page 343 / 2930
» Principles of problem solving
Sort
View
195
Voted
EOR
2007
174views more  EOR 2007»
15 years 7 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
191
Voted
JSW
2006
76views more  JSW 2006»
15 years 7 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
261
Voted
MP
2008
137views more  MP 2008»
15 years 7 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
181
Voted
MP
2006
93views more  MP 2006»
15 years 7 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
MP
2006
101views more  MP 2006»
15 years 7 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie