Found 97029 papers in total
An algorithm for colouring perfect planar graphs
1989,
This paper presents an algorithm to properly colour a perfect, planar graph G using γ ( G ) colours....
On the Windy Postman Problem on Eulerian graphs
1989,
The Windy Postman Problem (WPP) is defined as follows: Given an undirected connected graph G= ( V,E ) and...
On clustering problems with connected optima in Euclidean spaces
1989,
Let X be a finite subset of a Euclidean space, and ρ be a real function defined on the pairs of points...
An on-line graph coloring algorithm with sublinear performance ratio
1989,
One of the simplest heuristics for obtaining a proper coloring of a graph is the First-Fit algorithm: Fix...
STABULUS: A technique for finding stable sets in large graphs with tabu search
1989,
Numerical experiments with tabu search have been carried out for constructing independent sets in large...
New approaches for heuristic search: A bilateral linkage with artificial intelligence
1989,
This survey considers emerging approaches of heuristic search for solutions to combinatorially complex...
Decentralized control of automated guided vehicles on a simple loop
1989,
A highly decentralized greedy heuristic will enable a fleet of automated guided vehicles to deliver unit...
On-line sensitivity analysis of Markov chains
1989,
The authors consider discrete-event systems modeled as continuous-time Markov processes and characterized...
Upper bounds of a measure of dependence and the relaxation time for finite state Markov chains
1989,
This paper, considers a measure of dependence between X t and X 0 where X t is an irreducible Markov chain...
A new class of heuristic algorithms for weighted perfect matching
1988,
The minimum-weight perfect matching problem for complete graphs of n vertices with edge weights satisfying...
Large scale network analysis with applications to transportation, communication and inference networks
1988,
The study of large scale networks has been mainly motivated by practical problems. like transportation...
On fractional multicommodity flows and distance functions
1988,
The authors give some results on the existence of fractional and integral solutions to multicommodity flow...
Optimizing over a slice of the bipartite matching polytope
1988,
The paper discusses a special case of the Exact Perfect Matching Problem, which is polynomially solvable....
A multiply constrained matroid optimization problem
1988,
The authors consider the problem of finding a minimum weight basis in a matroid satisfying additional...
Convergence of gradient projection routing methods in an asynchronous stochastic quasi-static virtual circuit network
1989,
The convergence of the gradient projection algorithms for optimal routing in virtual circuit data networks...
Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks
1989,
A new gradient projection algorithm using iterative aggregation and disaggregation is proposed and...
On the relation of max-flow to min-cut for generalized networks
1989,
A generalized network is characterized by arc multipliers that are positive and not all equal to one. The...
Reducing the Hierarchical Network Design Problem
1989,
The Hierarchical Network Design Problem (HNDP) can be seen as a minimum spanning tree problem involving...
On max-flow min-cut and integral flow properties for multocommodity flows in directed networks
1989,
The multicommodity flow problem can represent many important problems encountered in a wide variety of...
Rectilinear shortest paths in the presence of rectangular barriers
1989,
In this paper the authors address the following shortest-path problem. Given a point in the plane and n...
A simple linear expected time algorithm for finding a Hamiltonian path
1989,
The paper gives a simple algorithm which either finds a hamilton path between two specified vertices of a...
A decomposition algorithm to determine the maximum flow in a generalized network
1989,
Generalized networks are characterized by the presence of positive arc multipliers not all equal to one....
A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems
1989,
The minimum cost, multiperiod network flow problem is an optimization model that is frequently used to...
A variant of the CESTAC method and its application to constraints optimization
1988,
The Vignes-La Porte CESTAC method enables the computer, when solving a problem in floating-point...
Papers per page:

Paper Filter