Pages that link to "Item:Q3890141"
From MaRDI portal
The following pages link to Database Location in Computer Networks (Q3890141):
Displaying 22 items.
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- Facility location models to locate data in information networks: a literature review (Q512996) (← links)
- Optimization of resource location in hierarchical computer networks (Q583895) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
- Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
- The multicovering problem (Q1205691) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Dynamic replication of web contents (Q2465735) (← links)
- (Q3031908) (← links)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (Q5138372) (← links)
- On page migration and other relaxed task systems (Q5958713) (← links)
- Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique (Q6102822) (← links)