Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
This paper defines the dense subhypergraph problem (DSP), which provides a generalized modelling framework for the nonlinear knapsack problem and other well-known problems arising in areas such as capital budgeting, flexible manufacturing system production planning, repair-kit selection, and compiler construction. We define several families of valid inequalities and state conditions under which these inequalities are facet-defining for DSP. We also explore the polyhedral structure of the cardinality-constrained DSP. Finally, we examine a special case of this problem that arises, for example, within the context of Lagrangian decomposition. For this case, we present a complete description of the convex hull of the feasible region.
- OSTI ID:
- 35924
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0188
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving multiple knapsack problems by cutting planes
A branch-and-cut algorithm for multiple sequence alignment