A heuristic partitioning algorithm for a packaging problem

DOI10.1007/BF02263431zbMath0507.90058MaRDI QIDQ1837627

M. B. Korchemkin

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

approximate solutionheuristic algorithmlarge-scale 0-1 programmingpackaging problemsingle source transportation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Unnamed Item
• Auxiliary procedures for solving long transportation problems
• An all Zero-One Algorithm for a Certain Class of Transportation Problems

This page was built for publication: A heuristic partitioning algorithm for a packaging problem