Keyword: graphs

Found 1175 papers in total
Integrating the analytic hierarchy process and graph theory to model facilities layout
Integrating the analytic hierarchy process and graph theory to model facilities layout
1998,
There is a trend in the research of facilities planning away from single-objective...
Max Horn Satisfiability and the minimum cut problem in directed hypergraphs
Max Horn Satisfiability and the minimum cut problem in directed hypergraphs
1998,
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to...
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
1998,
The network design problem is a multicommodity minimal cost network flow problem with...
The partial sum criterion for Steiner trees in graphs and shortest paths
The partial sum criterion for Steiner trees in graphs and shortest paths
1997,
The partial sum criterion with parameter p adds up the p largest weights in the...
How to select paired comparisons in AHP of incomplete information – strongly regular graph design
How to select paired comparisons in AHP of incomplete information – strongly regular graph design
1998,
It is said that paired comparison is the essence of AHP. But if there are N...
A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph
A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph
1998,
A family of quadratic programming problems whose optimal values are upper bounds on...
Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach
Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach
1996,
An AND/OR-graph approach has been proposed by Morabito et al . to solve non-staged and...
A neural network parallel algorithm for minimum maximal matching problems
A neural network parallel algorithm for minimum maximal matching problems
1998,
For a given graph G ( V, E ), a subset M of E is called a maximal matching of G if no...
Advances in solving the multicommodity-flow problem
Advances in solving the multicommodity-flow problem
1998,
The multicommodity-flow problem arises in a wide variety of important applications....
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
1997,
The Tree Knapsack Problem (TKP) can be regarded as a 0–1 knapsack problem on a...
An automatic approach to deadlock detection and resolution in discrete simulation systems
An automatic approach to deadlock detection and resolution in discrete simulation systems
1997,
In this article we develop an automatic deadlock detection scheme for general purpose...
Complexity of simulation models: A graph theoretic approach
Complexity of simulation models: A graph theoretic approach
1998,
In this article, we introduce complexity measures for simulation models. The framework...
A graph colouring model for assigning a heterogeneous workforce to a given schedule
A graph colouring model for assigning a heterogeneous workforce to a given schedule
1996,
We analyze a heterogeneous workforce assignment problem in which the minimum number of...
An efficient algorithm for a class of two-resource allocation problems
An efficient algorithm for a class of two-resource allocation problems
1998,
We propose an efficient algorithm for the two-resource allocation problem defined on a...
A note on convergence in the single facility minisum location problem
A note on convergence in the single facility minisum location problem
1998,
The single facility minisum location problem requires finding a point in R N that...
An axiomatic characterization of some locations in trees
An axiomatic characterization of some locations in trees
1996,
We describe axioms that uniquely characterize the absolute median and the squared...
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
1996,
The BSPS problem is to find a planar and biconnected spanning subgraph of a general...
Dominant graphs for rectilinear network design with barriers
Dominant graphs for rectilinear network design with barriers
1997,
Given a set of points on a Cartesian plane and the coordinate axes, the rectilinear...
Methodology for stochastic graph completion-time problems
Methodology for stochastic graph completion-time problems
1996,
Assume a completion time T 0 and a graph having edges with randomly chosen weights are...
A column generation approach for graph coloring
A column generation approach for graph coloring
1996,
We present a method for solving the independent set formulation of the graph coloring...
A branch-and-bound approach using polyhedral resuls for a clustering problem
A branch-and-bound approach using polyhedral resuls for a clustering problem
1997,
This article describes a variation of the branch and bound method for solving a...
The minimum vertex degree of a graph on uniform points in [0,1]d
The minimum vertex degree of a graph on uniform points in [0,1]d
1997,
On independent random points U 1 , …, U n distributed uniformly on [0,1] d , a...
The maximum vertex degree of a graph on uniform points in [0,1]d
The maximum vertex degree of a graph on uniform points in [0,1]d
1997,
A random graph G n ( x ) is constructed on independent random points U 1 , …, U...
A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
1998,
The n -job, two-machine, multi-robot flowshop scheduling problem is considered with...
Papers per page: