Found 97029 papers in total
A high-low search algorithm for a newsboy problem with delayed information feedback
1990,
This paper outlines a new approach to the problem of demand uncertainty. It deals with setting optimal...
Some comments on the analytic hierarchy process
1990,
Some comments are made on the analytic hierarchy process of Thomas L. Saaty, which has gained widespread...
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
1991,
Two algorithms have been described in the literature for determining the sophisticated voting decision...
The mixed integer linear bilevel programming problem
1990,
A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel...
A difficulty in particular Shannon-like games
1991,
There is a simple theory of strategy for generalized Shannon switching games (on edges). This theory...
A deletion game on hypergraphs
1991,
Two players alternately select either a vertex or an edge of a hypergraph H, deleting it together with all...
A generalized inspection game
1991,
The paper addresses the problem of a patrol trying to stop smugglers who are attempting to ship a cargo of...
Two-person zero-sum stochastic games
1991,
Two-person zero-sum stochastic games with finite state and action spaces are considered. The expected...
NP-completeness of edge-colouring some restricted graphs
1991,
The problem of determining the chromatic index of a regular graph of fixed degree r≥3 is known to be...
On an edge ranking problem of trees and graphs
1991,
A k-edge ranking of an undirected graph is a labeling of the edges of the graph with integers 1,2,..., k,...
When each hexagon of a hexagonal system covers it
1991,
In this paper the authors establish a simple criterion which enables them to determine whether or not a...
A note on isomorphic simulation of automata by networks of two-state automata
1991,
Let 𝒟 be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in 𝒟...
The relationship between the threshold dimension of split graphs and various dimensional parameters
1991,
Let the coboxicity of a graph G be denoted by cob( G), and the threshold dimension by t(G). For fixed...
On the use of augmenting chains in chain packings
1991,
In a graph G=(X,E), we assign to each node ν a positive integer b(ν)•d G (ν), where d G...
Lopsided Lovász Local lemma and Latin transversals
1991,
A new version of the Lovász Local lemma is used to prove the existence of Latin transversals in...
Holes in random graphs
1991,
It is shown that for every •>0 with the probability tending to 1 as n⇒• a random graph...
Lattice bandwidth of random graphs
1991,
The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves...
Some recent results on niche graphs
1991,
In an earlier paper entitled ‘Niche graphs’ written by Cable, Jones, Lundgren and Seager,...
Connectivity of generalized prisms over G.
1991,
The problem of building larger graphs with a given graph as an induced subgraph is one which can arise in...
Threshold spectra via the Ehrenfeucht game
1991,
Employing an analysis of the Ehrenfeucht game a partial characterization of the threshold spectra for...
A note on compact graphs
1991,
An undirected simple graph G is called compact iff its adjacency matrix A is such that the polytope S(A)...
Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
1991,
A graph is perfect if the size of the maximum clique equals the chromatic number in every induced...
Some relations between neighbourhood graphs for a permutation problem
1991,
Many discrete optimization problems belong to the class NP-hard. Therefore heuristics have been developed...
Simple heuristic methods for network routeing: A case study
1991,
This paper describes the development of simple heuristic methods for fast routeing of transmissions in a...
Papers per page:

Paper Filter