On integer network synthesis problem with tree-metric cost
نویسندگان
چکیده
منابع مشابه
Integer Exact Network Synthesis Problem
Given an integer, non-negative, symmetric matrix R = (rij)n×n, we consider the problem of synthesizing an undirected network G on node set V = {1, 2, . . . , n} with non-negative, integer edge capacities such that (i) for any pair {i, j} of distinct nodes in V , the value of maximum flow between i and j in G equals exactly rij ; and (ii) the sum of capacities of edges in G is minimum. Chou and ...
متن کامل2-Commodity Integer Network Synthesis Problem
We consider the following 2-commodity, integer network synthesis problem: Given two n×n, non-negative, symmetric, integer-valued matrices R = (rij) and S = (sij) of minimum flow requirements of 2 different commodities, construct an undirected network G = [N,E, c] on node set N = {1, 2, . . . , n} with integer edge capacities {c(e) : e ∈ E}, such that: (i) for any two pairs (i, j) and (k, l), i ...
متن کاملSolving the Convex Cost Integer Dual Network Flow Problem
In this paper, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form Σ(i,j)∈Q ij ij F (w ) + Σi∈P i i B ( ) μ ), the constraints are similar to those arising in the dual of a minimum cost flow problem (that is, of the form μi μj ≤ wij, (i, j) ∈ Q), with lower and upper bounds on variables. Let n = |P|, m = ...
متن کاملInteger Network Synthesis Problem for Hop Constrained Flows
Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of...
متن کاملOn the Multicriteria Integer Network Flow Problem
The Pareto Optimal set for the multicriteria network flow problem is described by the theorem for ParetoOptimal flow augmenting paths. An approach for determining of the unsupported integer PO solutions of the investigated problem is proposed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2017
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.9.73