Keyword: graphs

Found 1175 papers in total
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
1994,
The quickest path problem, which was originally proposed by Chen and Chin, is a...
Minimax resource allocation problems with resource-substitutions represented by graphs
Minimax resource allocation problems with resource-substitutions represented by graphs
1993,
Resource allocation problems focus on the allocation of limited resources among...
Minimum loss scheduling problems
Minimum loss scheduling problems
1992,
The paper considers two minimum loss scheduling problems. Let the arrival epochs and...
Multi-objective, preference-based search in acyclic OR-graphs
Multi-objective, preference-based search in acyclic OR-graphs
1992,
The authors consider the problem of determining a most preferred path from a start...
On the rank of a network incidence matrix
On the rank of a network incidence matrix
1992,
This paper analyses the rank of a path-link incidence matrix: that is, the number of...
Level schedules for mixed-model, Just-in-Time processes
Level schedules for mixed-model, Just-in-Time processes
1993,
A mixed-model manufacturing facility running under a Just-in-Time (JIT) production...
A note on ‘ON TESSA’
A note on ‘ON TESSA’
1994,
This note on a paper by Boswell [IAOR 51086] demonstrates that TESSA restricts the...
Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach
Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach
1994,
A recent paper by Boswell [IAOR 51086] claims the development of a new greedy...
Heuristics for the minimum Hamiltonian cycle problem. Part II: Partitioning heuristics for symmetric large scale graphs and guaranteed performance for the MinMax version
Heuristics for the minimum Hamiltonian cycle problem. Part II: Partitioning heuristics for symmetric large scale graphs and guaranteed performance for the MinMax version
1992,
This and a companion paper (Part I) describe the main heuristics for the symmetric...
Monotonic influence diagrams: Foundations and application to optimal design
Monotonic influence diagrams: Foundations and application to optimal design
1993,
Monotonic influence diagrams (MID) are proposed for qualitative and mathematical...
Monotonic influence diagrams: Extension to stochastic programming and application to probabilistic design
Monotonic influence diagrams: Extension to stochastic programming and application to probabilistic design
1993,
In this paper the theory of monotonic influence diagrams is extended to deal with...
Direct resolution of the general transhipment problem
Direct resolution of the general transhipment problem
1992,
This paper gives a resolution of the general transshipment problem, not by the theory...
A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction
A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction
1992,
This paper presents a simple method for avoiding both numerical errors and degeneracy...
An efficient tool for vectorizing a computer system
An efficient tool for vectorizing a computer system
1992,
This paper presents an efficient method that improves some procedures developed for...
Spoke contour conversion for coverage diagrams
Spoke contour conversion for coverage diagrams
1993,
This report discusses a solution method to convert spoke coverage diagrams into...
Optimal link test patterns in networks and the Chinese Postman Problem
Optimal link test patterns in networks and the Chinese Postman Problem
1992,
The problem of finding optimal link test patterns is a basic problem in...
An optimal group testing algorithm on k disjoint sets
An optimal group testing algorithm on k disjoint sets
1993,
Chang and Hwang proved that for two disjoint sets with m and n items each containing...
Games on a graph
Games on a graph
1992,
This paper is a survey of the various results obtained for combinatorial games, in...
An algorithm for M asymmetric travelling salesman problem on a bandwidth-limited graph
An algorithm for M asymmetric travelling salesman problem on a bandwidth-limited graph
1991,
This paper presents a polynomial dynamic programming based algorithm for solivng M...
Traveling salesman problem and local search
Traveling salesman problem and local search
1992,
It has been shown that certain NP-complete problems, i.e., TSP, min cut, and graph...
A dynamic programming algorithm for the Travelling Repairman Problem
A dynamic programming algorithm for the Travelling Repairman Problem
1989,
The paper presents a dynamic programming algorithm to the Travelling Repairman Problem...
The dynamics of plant layout
The dynamics of plant layout
1993,
This note develops a fathoming procedure for the Dynamic Plant Layout Problem...
Efficient organizing of design activities
Efficient organizing of design activities
1993,
Concurrent design should result in reduction of the duration of a design project, cost...
Comparison of routing methods for DCS-switched networks
Comparison of routing methods for DCS-switched networks
1993,
The market for nonswitched, high-rate digital leased lines (also called digital...
Papers per page: