Keyword: graphs

Found 1175 papers in total
Electre-like clustering from a pairwise fuzzy proximity index
Electre-like clustering from a pairwise fuzzy proximity index
2002,
In this paper, we propose an Electre-like approach for clustering judges from their L...
Fast heuristics for large scale covering-location problems
Fast heuristics for large scale covering-location problems
2002,
We propose fast heuristics for large-scale covering-location problems in which the set...
Defining tabu list size and aspiration criterion within tabu search methods
Defining tabu list size and aspiration criterion within tabu search methods
2002,
An investigation to explicitly define two key elements in tabu search methods is...
An extended planar algorithm for maximum integral two-flow
An extended planar algorithm for maximum integral two-flow
1998,
Several problems, including the maximum integral two-flow problem, are known to be...
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
1999,
We discuss a wide range of matching problems in terms of a network flow model. More...
Balanced network flows. II. Simple augmentation algorithms
Balanced network flows. II. Simple augmentation algorithms
1999,
In previous papers, we discussed the fundamental theory of matching problems and...
Balanced network flows. III. Strongly polynomial augmentation algorithms
Balanced network flows. III. Strongly polynomial augmentation algorithms
1999,
We discuss efficient augmentation algorithms for the maximum balanced flow problem...
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
1999,
In the minimum-cost strong network orientation problem (MCSO), we are given an...
A note on ‘maximally weighted graph theoretic facilities design planning’
A note on ‘maximally weighted graph theoretic facilities design planning’
2002,
This note explores the significance of John and Hammond's contributions in solving the...
Using a hybrid of exact and genetic algorithms to design survivable networks
Using a hybrid of exact and genetic algorithms to design survivable networks
2002,
Wide-band technology has the capability to carry many services such as voice, video...
Optimal adaptive fault diagnosis for simple multiprocessor systems
Optimal adaptive fault diagnosis for simple multiprocessor systems
1999,
We studied adaptive system-level fault diagnosis for multiprocessor systems....
Lower bounds for linear interval routing
Lower bounds for linear interval routing
1999,
Linear interval routing is a space-efficient routing method for point-to-point...
Deadlock-free interval routing schemes
Deadlock-free interval routing schemes
1999,
k -Interval labeling schemes ( k -ILS) are compact routing schemes on general networks...
Bounds for a problem of sequencing patterns
Bounds for a problem of sequencing patterns
1999,
In some wood cutting settings, the cutting sequence of the patterns produced to...
Finding all k-cliques in k-partite graphs, an application in textile engineering
Finding all k-cliques in k-partite graphs, an application in textile engineering
2002,
In many practical cases one has to choose an arrangement of different objects so that...
On generalized minimum spanning trees
On generalized minimum spanning trees
2001,
The generalized minimum spanning tree problem consists of designing a minimum cost...
The planning of marketing strategies in consumer credit: An approach based on graphical chain models for ordinal variables
The planning of marketing strategies in consumer credit: An approach based on graphical chain models for ordinal variables
2001,
This paper explores the potential of graphical chain models in defining marketing...
Defeasible logic graphs – I. Theory
Defeasible logic graphs – I. Theory
1998,
We propose development of an argument-based decision support system utilizing...
Defeasible logic graphs – II. Implementation
Defeasible logic graphs – II. Implementation
1998,
We propose development of an argument based decision support system utilizing...
On the optimality of a simple strategy for searching graphs
On the optimality of a simple strategy for searching graphs
2000,
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a...
A note on distributed multicast routing in point-to-point networks
A note on distributed multicast routing in point-to-point networks
2001,
The distributed algorithm for a multicast connection set-up, based on the...
Graphical method for identifying high outliers in construction contract auctions
Graphical method for identifying high outliers in construction contract auctions
2001,
Construction contract auctions are characterised by (1) a heavy emphasis on the lowest...
Determining the size and location of supplier for a minimum total distribution route-problem
Determining the size and location of supplier for a minimum total distribution route-problem
2001,
The locations of production units or warehouses that supply goods to demand positions...
Minimum-weight spanning tree algorithms: A survey and empirical study
Minimum-weight spanning tree algorithms: A survey and empirical study
2001,
The minimum-weight spanning tree problem is one of the most typical and well-known...
Papers per page: