Skip to main content
OSTI.GOVU.S. Department of Energy Office of Scientific and Technical Information
U.S. Department of Energy
Office of Scientific and Technical Information
 

On the continuous multiple-choice knapsack problem

Conference ·
OSTI ID:35934
; ;

In this talk we present some families of facets for the continuous multiple-choice knapsack polytope. An exact and an approximate algorithm for the solution of the problem are also considered. Some computational experience is reported.

OSTI ID:
35934
Report Number(s):
CONF-9408161--
Country of Publication:
United States
Language:
English

Similar Records

Solving multiple knapsack problems by cutting planes
Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36266
Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation
Conference · Fri Sep 03 00:00:00 EDT 1999 · OSTI ID:791413
The nonlinear knapsack problem
Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36131

Related Subjects

99 GENERAL AND MISCELLANEOUS
ACCURACY
ALGORITHMS
CONVERGENCE
MATRICES
NUMERICAL SOLUTION
OPTIMIZATION
VARIATIONAL METHODS