Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Optimal evasion from a pursuer with delayed information
2001,
Shinar J.
A class of prescribed duration pursuit–evasion problems with first-order...
Steiner minimal trees with one polygonal obstacle
2001,
Weng J.F.
In this paper we study the Steiner minimal tree T problem for a point set Z with...
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...
Appropriating value from computerized reservation system ownership in the airline industry
2001,
Lucas Henry C.
It is difficult for the firm competing through information technology resources to...
Multicriterion decision making in irrigation planning
1999,
Raju K.S.
Selection of the best compromise irrigation plan is examined in the multi objective...
Optimal irrigation allocation: A multilevel approach
2000,
Kumar D.N.
Optimal resources allocation strategies for a canal command in the semiarid region of...
Multireservoir modeling with dynamic programming and neural networks
2001,
Chandramouli V.
For optimal multireservoir operation, a dynamic programming-based neural network model...
The influence of task interruption on individual decision making: An information overload perspective
1999,
Valacich Joseph S.
Interruptions are a common aspect of the work environment of most organizations. Yet...
Linking information technology applications with manufacturing strategy: An intelligent decision support system approach
1999,
Igbaria Magid
Research has indicated the importance of matching Information Technology (IT)...
Optimal fault-tolerant networks with a server
2000,
Choudum S.A.
Fast computation through parallel processing and large distributed memory are two...
Chainwise paired comparisons
1999,
Ra Jang W.
The pairwise comparison technique is a building block of the Analytic Hierarchy...
Exact mixing in an unknown Markov chain
1995,
Lovsz Lszl
We give a simple stopping rule which will stop an unknown, irreducible n -state Markov...
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
2000,
Gouveia Luis
The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning...
The single allocation problem in the interacting three-hub network
2000,
Park Sungsoo
We consider the single allocation problem in the interacting three-hub network with...
Source-limited inclusive routing: A new paradigm for multicast communication
2000,
Torng Eric
In this paper, we study a combination of the multicast communication problem and the...
Network reliability with node failures
2000,
Liu Shaobin
Given a graph whose edges never fail but whose nodes fail independently of each other...
State space partition algorithms for stochastic systems with applications to minimum spanning trees
2000,
Alexopoulos Christos
We investigated state space partition methods for computing probability measures...
The searchlight guarding problem on weighted split graphs and weighted cographs
2000,
Tang C.Y.
This paper addresses the searchlight guarding problem, which is an extension of...
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
2000,
Yamashita Masafumi
In this paper, we investigate a probabilistic local majority polling game on weighted...
Constrained length connectivity and survivable networks
2000,
Ameur Walid Ben
Some problems related to constrained length connectivity are addressed in this paper....
Channel assignment and weighted coloring
2000,
McDiarmid Colin
In cellular telephone networks, set of radio channels (colors) must be assigned to...
Tabu search for the Steiner problem in graphs
2000,
Ribeiro Celso C.
Given an undirected graph with weights associated with its edges, the Steiner tree...
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
2000,
Pardalos Panos M.
In this paper, we propose an efficient heuristic approach for solving concave...
A characterization of the two-commodity network design problem
2000,
Sastry Trilochan
We study the uncapacitated version of the two-commodity network design problem. We...
First Page
283
284
285
286
287
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers