Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
type: Item
instance of: scholarly article
title: Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
zbMATH Open document ID: 0836.90141
DOI: 10.1007/BF02032163
author: Joseph B. Mazzola
author: Yves Crama
published in: Annals of Operations Research
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 830135
zbMATH Keywords: valid inequalities
zbMATH Keywords: flexible manufacturing system
zbMATH Keywords: production planning
zbMATH Keywords: dense subhypergraph problem
zbMATH Keywords: nonlinear knapsack problem
zbMATH Keywords: polyhedral structure
MaRDI profile type: Publication
cites work: Facets of the knapsack polytope
cites work: Polyhedral results for the precedence-constrained knapsack problem
cites work: Q3835301
cites work: A column generation approach to job grouping for flexible manufacturing systems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Order selection on a single machine with high set-up costs
cites work: A cutting-plane approach to the edge-weighted maximal clique problem
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Quadratic knapsack problems
cites work: On the supermodular knapsack problem
cites work: Q4178782
cites work: Lagrangean decomposition for integer programming : theory and applications
cites work: Facet of regular 0–1 polytopes
cites work: OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
cites work: Modelling and solving an FMS part selection problem
cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
cites work: Min-cut clustering
cites work: Q3048571
cites work: Q3997942
cites work: Q4040221
cites work: Properties of vertex packing and independence system polyhedra
cites work: Technical Note—A Note on Zero-One Programming
cites work: Covering, Packing and Knapsack Problems
cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Q3818127
cites work: Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
cites work: Faces for a linear inequality in 0–1 variables
cites work: Easily Computable Facets of the Knapsack Polytope
description: scientific article; zbMATH DE number 830135