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

DOI10.15807/JORSJ.50.376MaRDI QIDQ5385040zbMATH OpenOpenAlexFDO

Authors

Publication date 29 April 2008

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.50.376

zbMATH Keywords

0-1 knapsack problemautomated food packingdiscrete optimizationdynamic programming

Mathematics Subject Classification ID

Production models (90B30) Applications of mathematical programming (90C90)

Recommendations

• Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Optimal setup of a multihead weighing machine
• An algorithm for the bi-criterion integer programming problem
• A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem

Cited in

(3)

• Optimal setup of a multihead weighing machine
• Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers
• Pseudo-polynomial time algorithms for combinatorial food mixture packing problems

This page was built for publication: BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

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