Dynamic programming and lower-bound approaches to the minimum binding problem

DOI10.1080/00207720412331297901MaRDI QIDQ4653194zbMATH OpenOpenAlexFDO

Authors

Publication date 7 March 2005

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207720412331297901

zbMATH Keywords

dynamic programming algorithmminimum binding problem

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• A branch and bound algorithm for the minimum storage-time sequencing problem
• On lower bounds for a class of quadratic 0,1 programs
• Lower bounds based on linear programming for the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• Decorous lower bounds for minimum linear arrangement

Cites work

• Dynamic programming and lower-bound approaches to the minimum binding problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(2)

• Dynamic programming and lower-bound approaches to the minimum binding problem
• A Dynamic Programming Solution to Bounded Dejittering Problems

This page was built for publication: Dynamic programming and lower-bound approaches to the minimum binding problem

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