Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope

DOI10.1016/0166-218X(84)90017-9zbMath0555.90077MaRDI QIDQ761350

Frieda Granot, Daniel Granot

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

facetminimal coversextended covering constraintsirredundant equivalent representationpolynomial knapsack polytopeposynomial inequality

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

A generalized linear production model: A unifying model

Cites Work

• Lifting the facets of zero–one polytopes
• (1,k)-configurations and facets for packing problems
• 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
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra
• Canonical Cuts on the Unit Hypercube
• Unnamed Item

This page was built for publication: Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope