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
The β‐reliable minimax and maximin location problems on a network with probabilistic weights
2010,
Wang Jiamin
We study the β‐reliable minimax and maximin location problems on a network...
The network p-median problem with discrete probabilistic demand weights
2010,
Berman Oded
We study the problem of locating p facilities to serve clients residing at the nodes...
A computational evaluation of a general branch-and-price framework for capacitated network location problems
2009,
Righini Giovanni
The purpose of this paper is to illustrate a general framework for network location...
Implicit affinity networks and social capital
2009,
Smith M
Social networks are typically constructed based on explicit and well-defined...
The anchored network covering problem
2000,
Boffey T Brian
Path and tree covering problems are discussed and relations between them explored. It...
Efficient locations to optimize market share and maximum travel time in a duopoly competition model
2000,
Perez M D Garcia
We consider the problem of locating a new facility on a given path in a tree network...
Common resource management and network simulator in heterogeneous network environment
2009,
Kim Jae-Hoon
By the newly emerging network access technology, we face the new heterogeneous network...
A new traffic model for internet load estimation
2009,
Kim Hu-Gon
A traffic analysis on the Internet has an advantage for obtaining the characteristics...
Inferring missing links in partially observed social networks
2009,
Rhodes C J
Determining the pattern of links within a large social network is often problematic...
A survey on OR and mathematical methods applied on gene-environment networks
2009,
Weber Gerhard-Wilhelm
In this paper, we survey the recent advances and mathematical foundations of...
A Reach and Bound algorithm for acyclic dynamic-programming networks
2008,
Smith Robert L
Node pruning is a commonly used technique for solution acceleration in a...
Hide-and-seek games on a tree to which Eulerian networks are attached
2008,
Alpern Steve
We analyze the hide-and-seek game ⌈( G ) on certain networks G . The hider picks...
Price competition with elastic traffic
2008,
Ozdaglar Asuman
In this paper, we present a combined study of price competition and traffic control in...
A linear-time algorithm for broadcast domination in a tree
2009,
Dean Brian C
The broadcast domination problem is a variant of the classical minimum dominating set...
Compatible weights and valid cycles in non-spanning OSPF (open shortest path first) routing patterns
2009,
Holmberg Kaj
Many IP (Internet Protocol) networks use OSPF (Open Shortest Path First) for...
Advanced Scatter Search for the Max-Cut Problem
2009,
Laguna Manuel
The max–cut problem consists of finding a partition of the nodes of a weighted...
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
2009,
Puerto J
We consider the single–facility ordered median location problem with uncertainty...
A relax-and-cut algorithm for the knapsack node weighted Steiner tree problem
2008,
Trubian Marco
The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the...
Location of a reliable center on a tree network
2007,
Melachrinoudis Emanuel
This paper addresses the problem of locating a service facility on an undirected...
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints
2007,
Huang Wei
The multi–period single–sourcing problem that we address in this paper can...
The travelling preacher, projection, and a lower bound for the stability number of a graph
2008,
Cameron Kathie
The coflow min–max equality is given a travelling preacher interpretation, and...
A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
2008,
Carvalho F.D.
To obtain full cooperation from respondents, statistical offices must guarantee that...
Robust solutions for network design under transportation cost and demand uncertainty
2008,
Liu J.
In many applications, the network design problem (NDP) faces significant uncertainty...
A note on the minmax regret centdian location on trees
2008,
Conde Eduardo
The minmax regret optimization model of the doubly weighted centdian location on trees...
First Page
38
39
40
41
42
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers