scientific article; zbMATH DE number 1594561

MaRDI QIDQ2712370zbMATH OpenFDO

Authors M. Y. Kovalyov, Wieslaw Kubiak

Publication date 6 May 2001

zbMATH Keywords

discrete optimizationpartition type extremum problempolynomial approximationscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• scientific article; zbMATH DE number 1305477
• FPTAS for half-products minimization with scheduling applications
• Approximation of linear fractional-multiplicative problems
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation

Cited in

(6)

• Positive half-products and scheduling with controllable processing times
• Multilevel polynomial partitions and simplified range searching
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
• Exact and approximation algorithms for computing optimal fat decompositions
• Partitioning procedure for polynomial optimization

This page was built for publication:

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