Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
From MaRDI portal
Publication:1904710
DOI10.1007/BF02032163zbMath0836.90141MaRDI QIDQ1904710
Joseph B. Mazzola, Yves Cramer
Publication date: 7 January 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
production planningvalid inequalitiesflexible manufacturing systempolyhedral structurenonlinear knapsack problemdense subhypergraph problem
Related Items
A polyhedral approach for a constrained quadratic 0-1 problem, Berge-acyclic multilinear 0-1 optimization problems, Pseudo-Boolean optimization, Combinatorial optimization models for production scheduling in automated manufacturing systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral results for the precedence-constrained knapsack problem
- Order selection on a single machine with high set-up costs
- A cutting-plane approach to the edge-weighted maximal clique problem
- Min-cut clustering
- A column generation approach to job grouping for flexible manufacturing systems
- On the supermodular knapsack problem
- Easily Computable Facets of the Knapsack Polytope
- OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- Solving Large-Scale Zero-One Linear Programming Problems
- Lagrangean decomposition for integer programming : theory and applications
- Modelling and solving an FMS part selection problem
- Quadratic knapsack problems
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Technical Note—A Note on Zero-One Programming
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Covering, Packing and Knapsack Problems
- A Fast Parametric Maximum Flow Algorithm and Applications
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Properties of vertex packing and independence system polyhedra
- A Selection Problem of Shared Fixed Costs and Network Flows
