Results 21 to 30 of about 381 (184)
The Quickest Multicommodity Flow Problem [PDF]
, 2002 Traditionally, flows over time are solved in time expanded networks which contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the time expanded network.
Lisa Fleischer, Martin Skutella
openaire +1 more source
Combinatorial Auctions for Selling Network Capacity
Communications, 2006 The network economy is a term for today's global relationship among economic subjects characterized by massive connectivity. Today's network systems provide the infrastructure and foundation for the functioning of societies and economies.
Petr Fiala
doaj +1 more source
Multicommodity flows over time: Efficient algorithms and complexity
, 2003 Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. The common characteristic
Alex Hall +2 more
core +3 more sources
On resilience of multicommodity dynamical flow networks [PDF]
53rd IEEE Conference on Decision and Control, 2014 Dynamical flow networks with heterogeneous routing are analyzed in terms of stability and resilience to perturbations. Particles flow through the network and, at each junction, decide which downstream link to take on the basis of the local state of the network.
Gustav Nilsson +2 more
openaire +4 more sources
Complexity, 2018 Customer returns are a common phenomenon in many industries, and they have a significant impact on business organizations and their supply chains. False failure returns are returned products that have no functional or cosmetic defects, and they represent
Congdong Li +4 more
doaj +1 more source
Multicommodity flows and benders decomposition for restricted continuous location problems [PDF]
, 2018 The restricted continuous facility location problem arises when there is a need to locate a number of facilities to serve a discrete set of demand points, and where the location of a facility can be anywhere on the plane except for in restricted regions.
Bennell, JA +9 more
core +1 more source
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
A Scaling Algorithm for Multicommodity Flow Problems [PDF]
Operations Research, 1998 We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a finite number of scaling phases. The basis of the algorithm is simple and consists of iteratively detecting and sending flow around negative cost cycles.
Schneur, Rina., Orlin, James B.
openaire +3 more sources
Міжнародний науково-технічний журнал "Проблеми керування та інформатики"The article discusses methodological approaches to the construction of multicommodity hierarchical communication networks and identifies the main tasks of processing and distribution of discrete correspondence flows, which allow to create favorable ...
Володимир Олександрович Васянін +1 more
doaj +1 more source
The Klein bottle and multicommodity flows [PDF]
Combinatorica, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources