Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- 1 March 1995
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 58 (2) , 99-128
- https://doi.org/10.1007/bf02032163
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A column generation approach to job grouping for flexible manufacturing systemsEuropean Journal of Operational Research, 1994
- A cutting-plane approach to the edge-weighted maximal clique problemEuropean Journal of Operational Research, 1993
- Order selection on a single machine with high set-up costsAnnals of Operations Research, 1993
- Polyhedral results for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1993
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Best network flow bounds for the quadratic knapsack problemPublished by Springer Nature ,1989
- Degree sequences of connected hypergraphs and hypertreesPublished by Springer Nature ,1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Quadratic knapsack problemsPublished by Springer Nature ,1980
- Facets of the knapsack polytopeMathematical Programming, 1975