The minmax multidimensional knapsack problem with application to a chance‐constrained problem
Authors:
Open Access
- 17 May 2007
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 54 (6) , 656-666
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Simultaneous production of market‐specific and global products: A two‐stage stochastic program with additional demand after recourseNaval Research Logistics (NRL), 2003
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 2002
- A branch and bound method for stochastic integer problems under probabilistic constraintsOptimization Methods and Software, 2002
- Using Homogeneous Weights for Approximating the Partial Cover ProblemJournal of Algorithms, 2001
- Mid-term supply chain planning under demand uncertainty: customer demand satisfaction and inventory managementComputers & Chemical Engineering, 2000
- Concavity and efficient points of discrete distributions in probabilistic programmingMathematical Programming, 2000
- Planning logistics operations in the oil industryJournal of the Operational Research Society, 2000
- Stochastic programs over trees with random arc capacitiesNetworks, 1994
- Production planning via scenario modellingAnnals of Operations Research, 1993
- Relaxations for probabilistically constrained programs with discrete random variablesOperations Research Letters, 1992