Keyword: combinatorial analysis

Found 435 papers in total
Neural nets model for combinatorial optimization
Neural nets model for combinatorial optimization
1992,
Neural nets are a strongly inderdisciplinary research field. Therefore it seems useful...
The Fixed-Outdegree 1-Arborescence polytope
The Fixed-Outdegree 1-Arborescence polytope
1992,
A 1-arborescence is a spanning arborescence rooted at node 1, plus one arc incident...
Some results on visibility graphs
Some results on visibility graphs
1992,
A graph is a visibility graph if its vertices v 1 ,...,v n can be associated with...
Steiner’s problem in graphs: Heuristic methods
Steiner’s problem in graphs: Heuristic methods
1992,
Real world problems arising in the layout of connection structures in networks as e.g....
Integer programming in VLSI design
Integer programming in VLSI design
1992,
This paper surveys some recent developments in the application of combinatorial...
A method for solving the travelling salesman problem by the two-state neural network model
A method for solving the travelling salesman problem by the two-state neural network model
1991,
Hopfield has shown that the travelling salesman problem (TSP) can be solved on a...
Faces with large diameter on the symmetric traveling salesman polytope
Faces with large diameter on the symmetric traveling salesman polytope
1992,
This paper deals with the symmetric traveling salesman polytope and contains three...
Functional dependencies in relational databases: A lattice point of view
Functional dependencies in relational databases: A lattice point of view
1992,
A lattice theoretic approach is developed to study the properties of functional...
Selective inheritance of attribute values in relational databases
Selective inheritance of attribute values in relational databases
1992,
Selective inheritance dependencies, or SIDs, are introduced to capture formally the...
Locking based on a pairwise decomposition of a transaction system
Locking based on a pairwise decomposition of a transaction system
1992,
Locking is a synchronization primitive used in database systems to guarantee...
The number of keys in relational and nested relational databases
The number of keys in relational and nested relational databases
1992,
Combinatorial propositions, concerning the maximal number of minimal keys are...
Integer solution to synthesis of communication networks
Integer solution to synthesis of communication networks
1992,
This paper describes a polynomial-time algorithm for the following problem: Let be the...
The generalized basis reduction algorithm
The generalized basis reduction algorithm
1992,
Let F(x) be a convex function defined in R n , which is symmetric about the origin and...
Some existence results for multivalued complementarity problems
Some existence results for multivalued complementarity problems
1992,
This paper presents some new results for the existence of a solution to a multivalued...
An efficient parallel logarithmic time algorithm for the channel routing problem
An efficient parallel logarithmic time algorithm for the channel routing problem
1992,
In this paper the authors present a parallel algorithm for the channel routing...
A Manhattan channel router with good theoretical and practical performance
A Manhattan channel router with good theoretical and practical performance
1992,
Manhattan channel routing is attractive for practical applications in VLSI layout...
RS-vector algorithms for combinatorial problems
RS-vector algorithms for combinatorial problems
1992,
The RS-vector machine is a vector machine based on the vector operations called repeat...
Transmitting in the n-dimensional cube
Transmitting in the n-dimensional cube
1992,
Motivated by a certain communication problem the paper shows that for any integer n...
A cubic algorithm for the directed Eulerian subgraph problem
A cubic algorithm for the directed Eulerian subgraph problem
1991,
Given a directed graph G(V,A) with arcs weighted as w:A⇒Z, the authors seek a...
Paroids: A canonical format for combinatorial optimization
Paroids: A canonical format for combinatorial optimization
1992,
Almost all successful exact approaches to hard combinatorial optimization problems are...
A complete description of the traveling salesman polytope on 8 nodes
A complete description of the traveling salesman polytope on 8 nodes
1991,
The authors present three previously unknown classes of facets for the symmetric...
Narrowness, pathwidth, and their application in natural language processing
Narrowness, pathwidth, and their application in natural language processing
1992,
In the syntactic theory of Tesnière the structural description of sentences are...
The joint replenishment problem with general joint cost structures
The joint replenishment problem with general joint cost structures
1992,
The authors consider inventory sysems with several distinct items. Demands occur at...
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
1987,
The problem of scheduling a set of n jobs on m identical machines so as to minimize...
Papers per page: