From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
نویسندگان
چکیده
The virtual private network problem (Vpn) models scenarios where traffic is uncertain or rapidly changing. The goal is supporting at minimum cost a given family of traffic matrices, which are implicitly given by upper bounds on the ingoing and outgoing traffic at each node. Costs are classically defined by a linear function (linear Vpn), but we consider here also the more general case of concave increasing costs (concave Vpn).
منابع مشابه
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recentwork [Eisenbrand,Grandoni,Rothvoß,Schäfer-SODA’08], a new technique, core-detouring, is described to bound the mentioned connection cost. This is achieved by defining a sub-op...
متن کاملApproximation Algorithms for Single and Multi-Commodity Connected Facility Location
In the classical facility location problemwe are given a set of facilities, with associated opening costs, and a set of clients. The goal is to open a subset of facilities, and to connect each client to the closest open facility, so that the total connection and opening cost is minimized. In some applications, however, open facilities need to be connected via an infrastructure. Furthermore, con...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملImproved Approximation for Single-Sink Buy-at-Bulk
In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large cables by economies of scale. The problem i...
متن کاملA Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
We present the first constant-factor approximation algorithm for network design with multiple commodities andeconomies of scale. We consider the rent-or-buy problem, a type of multicommodity buy-at-bulk network design in which there are two ways to install capacity on any givenedge. Capacity can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 36 شماره
صفحات -
تاریخ انتشار 2011