Filters
A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem
In this paper the Integer Maximal Multicommodity Flow Problem is discussed. It belongs to the class of NP-hard combinatorial problems and thus for large scale instances must be solved by approximation or heuristic techniques. Many t...
BB - Aplikovaná statistika, operační výzkum
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Towards Duality of Multiroute Multicommodity Flows and Cuts: Multilevel Ball Growing
The paper describes an approximation algorithm for 3-route multicommodity flow and as a corollary a theorem about approximate duality of multiroute cuts and flows....
BA - Obecná matematika
- 2011 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing
In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in tra...
BB - Aplikovaná statistika, operační výzkum
- 2004 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Improved Bounds for the Unsplittable Flow Problem
A generalization and improvement of previous results of Leighton and Rao and Kleinberg and Rubinfeld about short multicommodity flow solutions and its application for the discrete multicommodity flow problem....
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Network Flows
Network flow problems are among the most important ones in graph theory. Many, telecommunications, etc. Examples of flow networks can be found, for example, in electrical tree problem, and Steiner tree problem, may...
BB - Aplikovaná statistika, operační výzkum
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Distributed Algorithm for Energy Optimal Multi-Commodity Network Flow Routing in Sensor Networks.
in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming. The algorithm computes the energy optimal routing ...
BC - Teorie a systémy řízení
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
theoremfor multicommodity h-route cuts and flows, for ha parts per thousand currencyAn elementary h-route flow, for an integer ha parts per thousand yen1, is a set of flow, and an h-route flow is a non-ne...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
an approximate duality theorem for multiroute multicommodity flows and cuts with a single cut is a natural generalization of the classical cut problem for multicommodity flows (take $h=1$). The main result of this...
BA - Obecná matematika
- 2012 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Improved Bounds for the Unsplittable Flow Problem
In this paper we consider the unsplittable flow problem (UFP): given a network, the flow number, that aims to capture global communication properties of the network multicommodity flow solutions i...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Disruption in Congested Networks
to congested traffic networks. In 1968, Braess presented an example of careless network changes, which led in congested networks to higher density of traffic. Since then, various versions of network design problem...
BB - Aplikovaná statistika, operační výzkum
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 78 810