Optimizing two types of discrete functions, subject to linear restrictions

DOI10.1016/0097-3165(77)90058-9zbMath0348.90135OpenAlexW2025834578MaRDI QIDQ1234633

David C. Rine

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90058-9

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some polyhedra related to combinatorial problems
• On Optimum Target Assignments
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• The Theory and Computation of Knapsack Functions

This page was built for publication: Optimizing two types of discrete functions, subject to linear restrictions