Sciweavers

ANOR
2011
131views more  ANOR 2011»
12 years 10 months 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
87views more  ANOR 2011»
12 years 10 months ago
Optimal production control of a failure-prone machine
Eugene Khmelnitsky, Ernst Presman, Suresh P. Sethi
ANOR
2011
104views more  ANOR 2011»
12 years 10 months ago
Using linear programming to analyze and optimize stochastic flow lines
Stefan Helber, Katja Schimmelpfeng, Raik Stolletz,...
ANOR
2011
214views more  ANOR 2011»
12 years 10 months 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...