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

DOI10.1007/BF01601344zbMath0372.90098MaRDI QIDQ1244170

Franz Weinberg

Publication date: 1977

Published in: ZAMP. Zeitschrift für angewandte Mathematik und Physik (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (5)

Cosmological consequences of the relativistic theory of gravitation with massive gravitons ⋮ Which fine-tuning arguments are fine? ⋮ A heuristic 0-1 integer programming method ⋮ A spectral algorithm for sequential aggregation of m linear diophantine constraints ⋮ Topological geometrodynamics

Cites Work

• Some polyhedra related to combinatorial problems
• Transformation of integer programs to knapsack problems
• New results on equivalent integer programming formulations
• Ganzzahlige lineare Programmierung und das Knapsack-Problem

This page was built for publication: A necessary and sufficient condition for the aggregation of linear Diophantine equations