Keyword: graphs

Found 1175 papers in total
A matching approach for replenishing rectangular stock sizes
A matching approach for replenishing rectangular stock sizes
2000,
Consider a replenishment problem in which several different rectangular sizes of...
An O(n log n) average time algorithm for computing the shortest network under a given topology
An O(n log n) average time algorithm for computing the shortest network under a given topology
1999,
In 1992 F.K. Hwang and J.F. Weng published an O(n 2 ) time algorithm for computing the...
Heuristic procedure neural networks for the capacitated minimum spanning tree problem
Heuristic procedure neural networks for the capacitated minimum spanning tree problem
2000,
Combinatorial optimization problems are by nature very difficult to solve, and the...
A cutting-plane procedure for maximizing revenues in yield management
A cutting-plane procedure for maximizing revenues in yield management
1997,
A graph-theory approach for allocating seats and setting optimal prices in an...
The berth planning problem
The berth planning problem
1998,
Singapore has one of the busiest ports in the world. Berth planning is one of the...
Upper and lower bounding procedures for minimum rooted k-subtree problem
Upper and lower bounding procedures for minimum rooted k-subtree problem
2000,
Given an undirected graph and a fixed root node on it, the minimum rooted k -subtree...
A cost optimal parallel algorithm for balanced decomposition trees
A cost optimal parallel algorithm for balanced decomposition trees
2000,
If an edge is removed from a binary tree, the tree is partitioned into two subtrees....
On the convergence of a randomized algorithm for a frequency assignment problem
On the convergence of a randomized algorithm for a frequency assignment problem
1998,
The problems of assigning frequencies to transmitters can be naturally modeled by...
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
2000,
Unlike its cousin, the Euclidean Traveling Salesman Problem (TSP), to the best of our...
A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs
A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs
2000,
The generalized stable set problem is an extension of the maximum weight stable set...
Some reverse location problems
Some reverse location problems
2000,
The general location problem in a network is to find locations of facilities in a...
Symmetries in distributed computing
Symmetries in distributed computing
2000,
A distributed system consists of a set of autonomous agents and a set of communication...
An optimal algorithm for solving the 1‐median problem on weighted 4‐cactus graphs
An optimal algorithm for solving the 1‐median problem on weighted 4‐cactus graphs
2000,
The median problem has been extensively studied in the last three decades. On general...
Heuristics for the mixed rural postman problem
Heuristics for the mixed rural postman problem
2000,
The Rural Postman Problem on a mixed graph (MRPP) consists of finding a minimum cost...
Bottleneck quadratic assignment problems and the bandwidth problem
Bottleneck quadratic assignment problems and the bandwidth problem
1998,
We present new lower bounds on the bandwidth problem of undirected graphs. The results...
Spatial Delaunay Gibbs point processes
Spatial Delaunay Gibbs point processes
1999,
This paper studies two types of Delaunay Gibbs point processes originally introduced...
Network companies and competitiveness: A framework for analysis
Network companies and competitiveness: A framework for analysis
1999,
Business networking for the purpose of becoming globally more competitive seems to...
On some properties of DNA graphs
On some properties of DNA graphs
1999,
Molecular biology, which aims to study DNA and protein structure and functions, has...
A 3/2-approximation algorithm for the mixed postman problem
A 3/2-approximation algorithm for the mixed postman problem
1999,
The mixed postman problem, a generalization of the Chinese postman problem, is that of...
The compactness of interval routing
The compactness of interval routing
1999,
The compactness of a graph measures the space complexity of its shortest path routing...
Graph partitioning and continuous quadratic programming
Graph partitioning and continuous quadratic programming
1999,
A continuous quadratic programming formulation is given for min-cut graph partitioning...
Random mappings with a single absorbing center and combinatorics of discretizations of the logistic mapping
Random mappings with a single absorbing center and combinatorics of discretizations of the logistic mapping
1999,
Distributions of basic characteristics of random mappings with a single absorbing...
Algorithms for path medi-centers of a tree
Algorithms for path medi-centers of a tree
1999,
We consider the problem of finding an optimal location of a path on a tree, using...
Scan-chain optimization methods for very large system integration
Scan-chain optimization methods for very large system integration
1999,
This paper presents a scan-chain optimization method for multiple scan-paths. The...
Papers per page: