File allocation involving worst case response times and link capacities: Model and solution procedure

DOI10.1016/0377-2217(93)90295-XzbMath0800.68325OpenAlexW1984086783MaRDI QIDQ1261331

Ishwar Murthy, Deb Ghosh

Publication date: 24 October 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90295-x

Mathematics Subject Classification ID

Integer programming (90C10) Theory of software (68N99)

Related Items (1)

A solution procedure for the file allocation problem with file availability and response time

Cites Work

• A Dual-Based Procedure for Uncapacitated Facility Location
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Methodology for the Design of Communication Networks and the Distribution of Data in Distributed Supercomputer Systems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Optimal program and data locations in computer networks
• Optimal File Allocation in a Multiple Computer System

This page was built for publication: File allocation involving worst case response times and link capacities: Model and solution procedure