A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems

MaRDI QIDQ5398526zbMATH OpenFDO

Authors Zongjun Luo

Publication date 28 February 2014

zbMATH Keywords

0-1 bottleneck problemdynamic programmingthreshold

Mathematics Subject Classification ID

Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1131754
• scientific article; zbMATH DE number 4005978
• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• scientific article; zbMATH DE number 1874147
• Generalized Bottleneck Problems^∗

Cited in

(2)

• scientific article; zbMATH DE number 1131754 (Why is no real title available?)
• A Dynamic Programming Solution to Bounded Dejittering Problems

This page was built for publication: A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems

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