A Nested Dual Ascent Procedure For The Dynamic Single File Allocation Problem

DOI10.1080/03155986.1993.11732226MaRDI QIDQ3142072zbMATH OpenOpenAlexFDO

Authors Ishwar Murthy, Pil K. Seo

Publication date 17 February 1994

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-bounddistributed computer systemsdynamic file allocationnested dual ascent procedure

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1286269
• A solution procedure for the file allocation problem with file availability and response time
• Competitive distributed file allocation.
• scientific article; zbMATH DE number 221925
• scientific article; zbMATH DE number 633701

Cited in

(3)

• A solution procedure for the file allocation problem with file availability and response time
• Allocating relations in a distributed database system
• scientific article; zbMATH DE number 1286269 (Why is no real title available?)

This page was built for publication: A Nested Dual Ascent Procedure For The Dynamic Single File Allocation Problem

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