Sciweavers

1547 search results - page 7 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
UM
2005
Springer
14 years 28 days ago
Modeling Individual and Collaborative Problem Solving in Medical Problem-Based Learning
Abstract. Since problem solving in group problem-based learning is a collaborative process, modeling individuals and the group is necessary if we wish to develop an intelligent tut...
Siriwan Suebnukarn, Peter Haddawy
IJAIT
2002
81views more  IJAIT 2002»
13 years 7 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
IOR
2008
105views more  IOR 2008»
13 years 7 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
CP
2008
Springer
13 years 9 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth