Pages that link to "Item:Q925830"

The following pages link to Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830):

Displaying 12 items.

• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
• Facility location models to locate data in information networks: a literature review (Q512996) (← links)
• Designing cost-effective content distribution networks (Q869005) (← links)
• A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem (Q879323) (← links)
• Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
• Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks (Q1661883) (← links)
• A new hybrid heuristic for replica placement and request distribution in content distribution networks (Q2341096) (← links)
• The location-dispatching problem: polyhedral results and content delivery network design (Q2861504) (← links)
• Solving replica placement and request distribution in content distribution networks (Q2883556) (← links)
• A two-level simulated annealing algorithm for efficient dissemination of electronic content (Q3394025) (← links)