Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: graphs
Found
1175 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A multiple pairs shortest path algorithm
2005,
Johnson Ellis L.
The multiple pairs shortest path problem (MPSP) arises in many applications where the...
An algorithm for the graph disconnection problem
2005,
Kim Hyun-Joon
We consider the graph disconnection problem, which is to find a set of edges such that...
An extended mutual reinforcement model for finding hubs and authorities from link structures on the WWW
2005,
Hwang Insoo
The network structures of a hyperlinked environment can be a rich source of...
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
2005,
Smith J. Cole
The Conditional Covering Problem (CCP) is a facility location problem on a graph,...
A dynamic programming algorithm for the conditional covering problem on tree graphs
2005,
Smith J. Cole
In a previous article, we presented algorithms for solving the Conditional Covering...
Generation of assembly graphs by systematic analysis of assembly structures
2006,
Lambert Alfred J.D.
In assembly line balancing problems, parallel execution of assembly operations is...
The three-dimensional assignment and partition problems. New lower bounds
2006,
Sergeev S.I.
For the three-dimensional assignment problem, new sharp lower bounds are derived from...
On the stability of approximation for Hamiltonian path problems
2006,
Forlizzi Luca
We consider the problem of finding a cheapest Hamiltonian path of a complete graph...
Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
2005,
Barnes J. Wesley
We consider modeling the reentrant job shop scheduling problem with sequence dependent...
Signed graphs for portfolio analysis in risk management
2002,
Harary Frank
We introduce the notion of structural balance for signed graphs in the context of...
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
2005,
Maculan Nelson
An O( n 2 ) algorithm is presented for the n jobs m parallel machines problem with...
Minimum power assignment in wireless ad hoc networks with spanner property
2006,
Wang Yu
Power assignment for wireless ad hoc networks is to assign a power for each wireless...
Maximizing federal natural gas royalties
2005,
Stoddard Steven A.
I conducted research to enable the US Minerals Management Services (MMS) to maximize...
An introduction to multi-parameter complexity analysis of discrete problems
2005,
Sevastianov S.V.
A notion of multi-parameter complexity analysis of a discrete problem as the...
Reliability function of a class of time-dependent systems with standby redundancy
2005,
Sakawa Masatoshi
By applying shortest path analysis in stochastic networks, we introduce a new approach...
The robust shortest path problem in series–parallel multidigraphs with interval data
2006,
Kasperski Adam
In this paper the robust shortest path problem in edge series–parallel...
A multiexchange local search algorithm for the capacitated facility location problem
2005,
Ye Yinyu
We present a multiexchange local search algorithm for approximating the capacitated...
Finding optimal realignments in sports leagues using a branch-and-cut-price approach
2005,
Mitchell John E.
The sports team realignment problem can be modeled as k-way equipartition: given a...
The US army uses a network optimization model to designate career fields for officers
2005,
Newman Alexandra M.
In 1999, the United States Army instituted a new career-progression pattern for its...
Strategic and dilemma analyses of a water export conflict
2005,
Hipel Keith W.
Two distinct approaches to formally studying conflict are described and compared by...
A short proof of the NP-completeness of minimum sum interval coloring
2005,
Marx Dniel
In the minimum sum coloring problem we have to assign positive integers to the...
The minimal feedback arc set problem
2004,
Aneja Y.P.
Given a directed network G(N;A), the minimum feedback arc set problem is to find an...
Two-connected Steiner networks: structural properties
2005,
Winter Pawel
We give a number of structural results for the problem of constructing a...
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
2005,
Dell'Olmo Paolo
Monitoring flows on networks is a research area for which a number of applications are...
First Page
29
30
31
32
33
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers