Results 41 to 50 of about 381 (184)

The All-or-Nothing Multicommodity Flow Problem

SIAM Journal on Computing, 2004
We consider the all-or-nothing multicommodity flow problem in general graphs. We are given a capacitated undirected graph G=(V,E,u) and set of k pairs s1t1, s2t2, …, sktk. Each pair has a unit demand. The objective is to find a largest subset S of 1,2,…,k such that for every i in S we can send a flow of one unit between si and ti.
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd   +2 more
openaire   +2 more sources

Research on Relieving Comprehensive Transportation Bottlenecks for Railway Capacity Based on Multiple Strategies

Journal of Advanced Transportation, Volume 2026, Issue 1, 2026.
Since 2015, China’s railway freight volume has steadily increased; however, the transportation capacity of the existing road network cannot fully adapt to the pressure caused by the increase in freight volume. In addition, the limitations of the current traffic flow adjustment system pose a significant risk of potential capacity bottlenecks in the road
Guangye Li, Shiwei He, Rixin Zhao, Ming Cong, Jinjin Cai, Giuseppe Musolino   +5 more
wiley   +1 more source

Directed multicommodity flows : cut-sufficiency and forbidden relevant minors

, 2022
In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands between vertices, represented by a demand graph H. This must be done simultaneously for all commodities, without exceeding edge capacities.
Poremba, Joseph Chester
core  

Drayage Routing Problems: A Comprehensive Survey and a New Compact Model

Australian &New Zealand Journal of Statistics, Volume 67, Issue 4, Page 491-526, December 2025.
ABSTRACT Drayage involves short‐distance container trucking, a crucial part of intermodal transportation that fills the gap between long‐haul transportation modes and inland facilities. Because of its high costs, drayage has been increasingly drawing the attention of researchers and practitioners from different disciplines, who have been exploring ...
Daniel Bustos‐Coral, Alysson M. Costa
wiley   +1 more source

Investigation of Railway Network Capacity by Means of Dynamic Flows

Applied Sciences
Capacity calculations are essential for the long-term planning of railway infrastructure. Many of the methods currently used in practice calculate characteristic capacity values separately for the single elements (mainly lines and nodes) of a railway ...
Dominik Nikolayzik, Maren Maus, Nils Nießen   +2 more
doaj   +1 more source

Integer multicommodity flows with reduced demands [PDF]

, 1993
Given a supply graph G=(V, E), a demand graph H=(T, D), edge capacities c: E ↦ ℕ and requests r: D ↦ ℕ, we consider the problem of finding integer multiflows subject to c, r. Korach and Penn constructed approximate integer multiflows for planar graphs, but no results were known for the general case.
Srivastav, Anand, Stangier, Peter
openaire   +1 more source

Multicommodity flows over time: Efficient algorithms and complexity

, 2007
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.
Alex Hall, Hall, Alex, Skutella, Martin, Martin Skutella, Steffen Hippler, Hippler, Steffen   +5 more
core   +1 more source

Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport

Networks, Volume 85, Issue 2, Page 205-222, March 2025.
ABSTRACT In hazardous material transport on road networks, two conflicting objectives must be addressed simultaneously: minimizing risk and minimizing cost. Risk mitigation policies may yield as a secondary outcome uneven flow distribution on the network. This study empowers an existing risk mitigation policy based on gateways (GBP) to improve fairness.
Paola Cappanera, Maddalena Nonato
wiley   +1 more source

Mathematical Models of the Problem of Constructing Delivery Routes of Cargo in the Internal Zones of Trunk Nodes of a Hierarchical Transport Network

Кібернетика та комп'ютерні технології
Introduction. The article discusses mathematical models of problems of constructing circular routes of vehicles in a multicommodity hierarchical network.
Volodymyr Vasyanin, Liudmyla Ushakova
doaj   +1 more source

Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning

Networks, Volume 85, Issue 1, Page 3-37, January 2025.
Abstract In this article, we study the integrated hurricane relief logistics and evacuation planning (IHRLEP) problem, integrating hurricane evacuation and relief item pre‐positioning operations that are typically treated separately. We propose a fully adaptive multistage stochastic programming (MSSP) model and solution approaches based on two‐stage ...
Sudhan Bhattarai, Yongjia Song
wiley   +1 more source