Ganzzahlige lineare Programmierung und das Knapsack-Problem

DOI10.1007/BF00532511MaRDI QIDQ5678657zbMATH OpenFDO

Authors Beat F. Schmid

Publication date 1972

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00532511

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(1)

• A necessary and sufficient condition for the aggregation of linear Diophantine equations

This page was built for publication: Ganzzahlige lineare Programmierung und das Knapsack-Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5678657)