Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
From MaRDI portal
(Redirected from Publication:898726)
Recommendations
- Faster and simpler approximation algorithms for mixed packing and covering problems
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Parameterized approximation algorithms for packing problems
- scientific article; zbMATH DE number 1670546
- Polynomial time approximation schemes for class-constrained packing problems
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 2163022
- scientific article; zbMATH DE number 2196275
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
Cites work
This page was built for publication: Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898726)