Least-cost partition algorithms

DOI10.1016/0166-218X(88)90097-2MaRDI QIDQ1823166zbMATH OpenOpenAlexWikidataFDO

Authors Thomas J. jun. Marlowe, Marvin C. Paull

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(88)90097-2

zbMATH Keywords

knapsack problemaverage-case complexityleast-cost partition problemworst-cost complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• scientific article; zbMATH DE number 1161371
• scientific article; zbMATH DE number 3908442
• scientific article; zbMATH DE number 1559404
• Publication:4953911
• Approximation Algorithms for the Minimum Convex Partition Problem
• Partitioning a matrix to minimize the maximum cost
• scientific article; zbMATH DE number 2100545
• Minimum-cost load-balancing partitions
• Approximation algorithms for array partitioning problems

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3668616 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 192839 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• A program data flow analysis procedure
• Fast Algorithms for Solving Path Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Least-cost partition algorithms
• Optimum binary search trees
• The Theory and Computation of Knapsack Functions

Cited in

(4)

• scientific article; zbMATH DE number 3989105 (Why is no real title available?)
• Analysis of the knapsack problem using L-partition
• Least-cost partition algorithms
• scientific article; zbMATH DE number 4041263 (Why is no real title available?)

This page was built for publication: Least-cost partition algorithms

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