An integer programming model for the allocation of databases in a distributed computer system
From MaRDI portal
Publication:1083877
DOI10.1016/0377-2217(86)90142-6zbMath0605.68103OpenAlexW2005343989MaRDI QIDQ1083877
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90142-6
Integer programming (90C10) Information storage and retrieval of data (68P20) Theory of software (68N99)
Related Items
Application of facility location modeling constructs to vendor selection problems, Efficient algorithms for the capacitated concentrator location problem, Heuristics for the multi-resource generalized assignment problem, Assignment problems: a golden anniversary survey, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, A review of congestion models in the location of facilities with immobile servers, Designing cost-effective content distribution networks, A Survey of the Generalized Assignment Problem and Its Applications, Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique, The capacitated maximal covering location problem with backup service, Exact algorithms for the joint object placement and request routing problem in content distribution networks, The hierarchical network design problem with transshipment facilities, Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding, A multiple criteria model for the allocation of data files in a distributed information system, Facility location models to locate data in information networks: a literature review, Locating concentrators in centralized computer networks, Capacitated emergency facility siting with multiple levels of backup, Formulating and solving production planning problems, Heuristic methods and applications: A categorized survey, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Resource allocation and capacity assignment in distributed systems, A survey of models and algorithms for winter road maintenance. II: System design for snow disposal
Uses Software
Cites Work
- Unnamed Item
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Database Location in Computer Networks
- An Algorithm for Large Zero-One Knapsack Problems
- Optimization of the Number of Copies in a Distributed Data Base
- A branch and bound algorithm for the generalized assignment problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Optimal program and data locations in computer networks
- Some theorems to aid in solving the file allocation problem
- Validation of subgradient optimization
- Optimal File Allocation in a Multiple Computer System
