Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: networks
Found
1865 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
External costs of the Belgian interurban freight traffic: A network analysis of their internalisation
2002,
Beuthe M.
The strong expansion of freight road transports throughout Europe is an important...
Paradoxes in networks with zero emission links: Implications for telecommunications versus transportation
2001,
Nagurney Anna
In this paper, we consider networks in which a link is characterized by zero emissions...
An integrated model of facility location and transportation network design
2001,
Daskin Mark S.
Network location models have been used extensively for siting public and private...
A bridge between travel demand modeling and activity-based travel analysis
2001,
Recker W.W.
The focus of this paper is on the demonstration that some rather well-known...
An adaptive routing algorithm for in-vehicle route guidance systems with real-time information
2001,
Fu Liping
This paper examines the problem of routing a given vehicle through a traffic network...
Bi-directional self-healing ring network planning
2002,
Wen Ue-Pyng
In this paper we study the network planning problem of bi-directional self-healing...
Inventory models with random yield in a random environment
2002,
zekici Suleyman
We consider a single item inventory model which is observed periodically in a randomly...
Partitioning of biweighted trees
2002,
Mirchandani Pitu B.
A districting problem is formulated as a network partitioning model where each link...
A note on ‘Highway pricing and capacity choice in a road network under a build-operate-transfer scheme’
2002,
Yang Hai
This note rectifies an error in the paper by Yang and Meng on highway pricing and...
Machine diagnosis and maintenance policy generation using adaptive decision tree and shortest path problem
2002,
Back Jun-Geol
CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because...
A network disruption modeling tool
2002,
Deckro Richard F.
Identifying network components, which when targeted will effectively disrupt a...
Sensitivity analysis for stochastic user equilibrium network flows – a dual approach
2001,
Ying J.Q.
Recently, extensive studies have been conducted on the computational methods of...
An aggregation approach to solving the network p-median problem with link demands
2000,
Batta Rajan
This paper considers the p -median problem on a general network with link demands. We...
Node placement and sizing for copper broadband access networks
2001,
Shallcross David
We consider a node placement and sizing problem that arises in certain types of...
A tabu search algorithm for access network design
2001,
Sans Brunilde
We present a fast tabu search method for the design of access tree networks. We...
Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
2001,
Heuvel Jan Van Den
A Frequency Assignment Problem (FAP) is the problem that arises when frequencies have...
Optimization of network topologies for service providers in the telecommunications market
2001,
Pressmar Dieter B.
Following the deregulation of communications services, a growing number of commercial...
Performance analysis of carrier sense multiple access with collision avoidance protocol for high-speed wireless local area networks
2002,
Yue Wuyi
In this paper, we present an exact analysis to numerically evaluate the performance of...
Designing least-cost survivable wireless backhaul networks
2000,
Cox Louis Anthony
This paper presents a new heuristic algorithm for designing least-cost...
Fault-tolerant routings in chordal ring networks
2000,
Fbrega Josep
This paper studies routing vulnerability in networks modeled by chordal ring graphs....
Low-congested interval routing schemes for hypercubelike networks
2000,
Flammini Michele
In this paper, we provide low-congested interval routing schemes (IRS) for some common...
Topological expansion of multiple-ring metropolitan area networks
2000,
Sans Brunilde
This paper presents a mixed 0–1 linear programming model for the metropolitan...
A primal–dual steepest-edge method for even-flow harvest scheduling problems
2002,
Liu Chiun-Ming
The even-flow harvest scheduling problem arises when the forestry agency has evolved...
An exact algorithm for the maximum k-club problem in an undirected graph
2002,
Laporte Gilbert
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
First Page
53
54
55
56
57
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers