Pseudo-polynomial time algorithms for combinatorial food mixture packing problems

DOI10.3934/jimo.2016.12.1057zbMath1328.90126OpenAlexW2524620518MaRDI QIDQ898726

Kenju Tateishi, Yoshiyuki Karuno, Shinji Imahori

Publication date: 18 December 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2016.12.1057

zbMATH Keywords

dynamic programmingcombinatorial optimizationmathematical modelingfood packaging qualitypseudo-polynomial time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Unnamed Item

This page was built for publication: Pseudo-polynomial time algorithms for combinatorial food mixture packing problems