Keyword: networks: flow

Found 611 papers in total
Arc-flow model for the two-dimensional guillotine cutting stock problem
Arc-flow model for the two-dimensional guillotine cutting stock problem
2010,
We describe an exact model for the two-dimensional cutting stock problem with two...
Sharing the cost of a capacity network
Sharing the cost of a capacity network
2010,
We consider a communication network where each pair of users requests a connection...
A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies
A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies
2010,
This paper discusses a dynamic evacuation network optimization problem that...
A stochastic model to study the system capacity for supply chains in terms of minimal cuts
A stochastic model to study the system capacity for supply chains in terms of minimal cuts
2010,
For a single-commodity stochastic flow network, the system capacity is the maximum...
On the use of graphs in discrete tomography
On the use of graphs in discrete tomography
2010,
In this tutorial paper, we consider the basic image reconstruction problem which stems...
Fast paths in large-scale dynamic road networks
Fast paths in large-scale dynamic road networks
2010,
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic...
Intra-domain traffic engineering with shortest path routing protocols
Intra-domain traffic engineering with shortest path routing protocols
2009,
Throughout the last decade, extensive deployment of popular intra-domain routing...
A bundle-type algorithm for routing in telecommunication data networks
A bundle-type algorithm for routing in telecommunication data networks
2009,
To optimize the quality of service through a telecommunication network, we propose an...
Solving the Steiner Two-Node-Survivable Network Problem
Solving the Steiner Two-Node-Survivable Network Problem
2010,
In the design of optical fibre networks, a commonly applied requirement is to ensure...
Penalty adapting ant algorithm: Application to pipe network optimization
Penalty adapting ant algorithm: Application to pipe network optimization
2008,
A penalty adapting ant algorithm is presented in an attempt to eliminate the...
A dual exterior point simplex type algorithm for the minimum cost network flow problem
A dual exterior point simplex type algorithm for the minimum cost network flow problem
2009,
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is...
Yard Planning Considering the Load Profile of Resources in Container Terminals
Yard Planning Considering the Load Profile of Resources in Container Terminals
2009,
The main activities of container terminals are to load container freights to vessels,...
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
2008,
Rosenthal's congestion games constitute one of the few known classes of noncooperative...
Models and tabu search metaheuristics for service network design with asset-balance requirements
Models and tabu search metaheuristics for service network design with asset-balance requirements
2009,
This paper focuses on a generic model for service network design, which includes asset...
Modelling the South African fruit export infrastructure: A case study
Modelling the South African fruit export infrastructure: A case study
2006,
A description is provided of work performed as part of the fruit logistics...
Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem
Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem
2007,
The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important...
A framework for user equilibrium dynamic traffic assignment
A framework for user equilibrium dynamic traffic assignment
2009,
Several analytic approaches have been developed to describe or predict traffic flows...
OR PRACTICE—Optimization of Vacation Timeshare Scheduling
OR PRACTICE—Optimization of Vacation Timeshare Scheduling
2008,
This paper reports on an application of network–flow integer programming to a...
Topological uniqueness of the Nash equilibrium for selfish routing with atomic users
Topological uniqueness of the Nash equilibrium for selfish routing with atomic users
2007,
We consider the problem of selfish routing in a congested network shared by several...
Note on the continuity of M-convex and L-convex functions in continuous variables
Note on the continuity of M-convex and L-convex functions in continuous variables
2008,
M–convex and L–convex functions in continuous variables constitute...
Wide area telecommunication network design: application to the Alberta SuperNet
Wide area telecommunication network design: application to the Alberta SuperNet
2008,
This article proposes a solution methodology for the design of a wide area...
Stochastic and minimum regret formulations for transmission network expansion planning under uncertainties
Stochastic and minimum regret formulations for transmission network expansion planning under uncertainties
2008,
After deregulation of the Power sector, uncertainty has increased considerably....
Application of network methods in intelligent supply chain management
Application of network methods in intelligent supply chain management
2007,
A good understanding of supply chain flows is a prerequisite for intelligent supply...
An efficient generalized network-simplex-based algorithm for manufacturing network flows
An efficient generalized network-simplex-based algorithm for manufacturing network flows
2008,
Fang and Qi introduced a new generalized network flow model called manufacturing...
Papers per page: