Country: Netherlands

Found 18376 papers in total
Determining priorities for projects with uncertain benefits: An application to data management
Determining priorities for projects with uncertain benefits: An application to data management
1994,
It is increasingly imperative that the data resource be managed effectively. An...
A new adaptive multi-start technique for combinatorial global optimizations
A new adaptive multi-start technique for combinatorial global optimizations
1994,
The authors analyze relationships among local minima for the traveling salesman and...
L-polytopes and equiangular lines
L-polytopes and equiangular lines
1995,
A construction providing sets of equiangular lines from integral lattices is given....
Probing the arrangement of hyperplanes
Probing the arrangement of hyperplanes
1995,
This paper investigates the combinatorial complexity of an algorithm to determine the...
Probabilities within optimal strategies for tournament games
Probabilities within optimal strategies for tournament games
1995,
Let T be a tournament. The tournament game on T is: Two players independently pick a...
Solution of the knight’s Hamiltonian path problem on chessboards
Solution of the knight’s Hamiltonian path problem on chessboards
1994,
Is it possible for a knight to visit all squares of an n×n chessboard on an...
Edge-disjoint packings of graphs
Edge-disjoint packings of graphs
1994,
In this paper the authors study two types of edge-disjoint packings of graphs. The...
Guarding rectangular art galleries
Guarding rectangular art galleries
1994,
Consider a rectangular art gallery divided into n rectangular rooms, such that any two...
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
1994,
Two combinatorial problems raised by the fundamental question of the existence and...
Does reliable information improve the accuracy of judgmental forecasts?
Does reliable information improve the accuracy of judgmental forecasts?
1995,
This study investigates people’s ability to use information when forecasting...
More facets from fences for linear ordering and acyclic subgraph polytopes
More facets from fences for linear ordering and acyclic subgraph polytopes
1994,
The authors present new facets for the linear ordering polytope. These new facets...
On Halin subgraphs and supergraphs
On Halin subgraphs and supergraphs
1995,
In this paper, the authors present two complexity results. The first pertains to the...
Clique covering and clique partition in generalizations of line graphs
Clique covering and clique partition in generalizations of line graphs
1995,
Cliques are complete subgraphs of a graph. This note shows that minimum sets of...
Bipolar orientations revisited
Bipolar orientations revisited
1995,
Acyclic orientations with exactly one source and one sink-the so-called bipolar...
Hypercube embedding of generalized bipartite metrics
Hypercube embedding of generalized bipartite metrics
1995,
A metric d is h- embeddable if it can be isometrically embedded in some hypercube....
Polynomial invariants of graphs with state models
Polynomial invariants of graphs with state models
1995,
The authors reformulate a polynomial invariant of graphs defined by Negami, using the...
Universal covers of graphs: Isomorphism to depth n-1 implies isomorphism to all depths
Universal covers of graphs: Isomorphism to depth n-1 implies isomorphism to all depths
1995,
Vertex- and edge-labeled digraphs have been used to model computer networks, and the...
Compatible eulerian circuits in
Compatible eulerian circuits in
1995,
Let be the complete symmetric digraph with a loop at each vertex. The authors say that...
Joint performance of greedy heuristics for the integer knapsack problem
Joint performance of greedy heuristics for the integer knapsack problem
1995,
This paper analzyes the worst-case performance of combinations of greedy heuristics...
A lower bound of the expected maximum number of edge-disjoint s-t paths on probabilistic graphs
A lower bound of the expected maximum number of edge-disjoint s-t paths on probabilistic graphs
1995,
For a probabilistic graph , where G is an undirected graph with specified source...
On the channel capacity of read/write isolated memory
On the channel capacity of read/write isolated memory
1995,
The paper applies graph theory to find upper and lower bounds on the channel capacity...
Half-integral flows in a planar graph with four holes
Half-integral flows in a planar graph with four holes
1995,
Suppose that s a planar graph embedded in the conclusion plane, that I, J, K, O are...
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
1995,
This paper solves, in the affermative, the open question of whether the...
The depth and width of local minima in discrete solution spaces
The depth and width of local minima in discrete solution spaces
1995,
Heuristic search techniques such as simulated annealing and tabu search require...
Papers per page: