An optimal algorithm for the two-order multiple problem

MaRDI QIDQ5260307zbMATH OpenFDO

Authors Long Wan

Publication date 29 June 2015

zbMATH Keywords

algorithm complexityoptimal algorithmtwo-order multiple problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3906215
• Complexity of min-max subsequence problems
• scientific article; zbMATH DE number 6861975
• scientific article; zbMATH DE number 3898616
• Optimal composition ordering problems for piecewise linear functions

Cited in

(5)

• Complexity of min-max subsequence problems
• scientific article; zbMATH DE number 63645 (Why is no real title available?)
• Optimal composition ordering problems for piecewise linear functions
• Algorithms for two bottleneck optimization problems
• scientific article; zbMATH DE number 3942929 (Why is no real title available?)

This page was built for publication: An optimal algorithm for the two-order multiple problem

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