41 search results - page 3 / 9 » A Knapsack Secretary Problem with Applications |
MP
2010
13 years 1 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
EOR
2000
13 years 7 months ago
2000
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
EOR
2008
13 years 7 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
WSC
1997
13 years 8 months ago
1997
This paper presents an implementation methodology appropriate for providing a broad range of proven, classical Operations Research methods and techniques to the simulation modeler...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...