Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: networks: flow
Found
611 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Dynamic milk-run OEM operations in over-congested traffic conditions
2015,
Novaes Antonio G N
Dynamic vehicle routing problems have received increasing attention in the literature...
Social Network based sensitivity analysis for patient flow using computer simulation
2015,
Nikakhtar Amin
Prediction of patient flow, an essential element of any healthcare system, is...
Efficient algorithms for the maximum concurrent flow problem
2015,
Ben-Ameur Walid
In this article, we propose a generic decomposition scheme for the maximum concurrent...
A compact linear programming formulation of the maximum concurrent flow problem
2015,
Dong Yuanyuan
We present an alternative linear programming formulation of the maximum concurrent...
Evasive flow capture: Optimal location of weigh-in-motion systems, tollbooths, and security checkpoints
2015,
Schonfeld Paul
The flow‐capturing problem (FCP) consists of locating facilities to maximize...
Application of temporal difference learning rules in short-term traffic flow prediction
2015,
Moshiri Behzad
Studying dynamic behaviours of a transportation system requires the use of the system...
A network traffic flow model for motorway and urban highways
2014,
Yang Chao
The research reported in this paper develops a network‐level traffic flow model...
A model for evaluating the environmental and functional benefits of ‘innovative’ roundabouts
2015,
Rizzo Gianfranco
This study looks at the singling out of a multi‐parameter criterion for...
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
2015,
Wu Weili
Connected dominating set ( CDS ) has played an important role in building virtual...
Definition of optimal fleets for Sea Motorways: the case of France and Spain on the Atlantic coast
2015,
MartnezLpez Alba
This work introduces an optimisation model to define the technical and operative...
A logistics model for the transport of disaster victims with various injuries and survival probabilities
2015,
Jin Sukho
We propose an optimization model for patient delivery and medical resource allocation...
Transfer Implementation in Congestion Games
2015,
Arieli Itai
We study an implementation problem faced by a planner who can influence selfish...
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network
2016,
Murota Kazuo
In the evaluation of network reliability, the objectives are to model reliability of...
Multiple-path selection for new highway alignments using discrete algorithms
2016,
Lucet Yves
This paper addresses the problem of finding multiple near‐optimal,...
A flow-dependent quadratic steiner tree problem in the Euclidean plane
2014,
Brazil Marcus N
We introduce a flow‐dependent version of the quadratic Steiner tree problem in...
Exact algorithms for solving a Euclidean maximum flow network interdiction problem
2014,
Cole Smith J
We consider an interdiction problem that involves an operator (or defender) whose goal...
Substitutes, complements, and ripples in multicommodity flows on suspension graphs
2014,
Granot Frieda
We examine in this article when it is possible to predict, without numerical...
Single network adaptive critic aided dynamic inversion for optimal regulation and command tracking with online adaptation for enhanced robustness
2014,
Padhi Radhakant
To combine the advantages of both stability and optimality‐based designs, a...
Investigating the impact of access-timing-sizing regulations on urban logistics
2015,
Awasthi Anjali
Freight regulations (e.g., vehicle timing, sizing and access restrictions)...
Developments and prospects of freight railway transport in Northern Germany: a Delphi survey
2014,
Matopoulos Aristides
Despite the fact that Germany has a well expanded traffic infrastructure, it confronts...
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
2015,
Ghiyasvand Mehdi
Given a directed bipartite graph G = ( V , E ) with a node set V = { s } ∪ V 1...
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
2015,
Lingas Andrzej
We present a new approach to the minimum‐cost integral flow problem for small...
Angle-Restricted Steiner Arborescences for Flow Map Layout
2015,
Buchin Kevin
We introduce a new variant of the geometric Steiner arborescence problem, motivated by...
Dynamic output feedback of networked control systems with partially known Markov chain packet dropouts
2015,
Mahmoud Magdi S
In this paper, a class of networked control systems with output feedback control and H...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers