Keyword: combinatorial analysis

Found 435 papers in total
UET-scheduling with constrained processor allocations
UET-scheduling with constrained processor allocations
1992,
The authors consider a generalization of the precedence constrained scheduling problem...
A branch-and-bound algorithm to minimize total tardiness with different release dates
A branch-and-bound algorithm to minimize total tardiness with different release dates
1992,
This article deals with the scheduling problem for minimizing total tardiness with...
A sub-logarithmic time sorting algorithm on a reconfigurable array
A sub-logarithmic time sorting algorithm on a reconfigurable array
1991,
A bus system whose configuration can be dynamically changed is called a reconfigurable...
Interactive procedure for non-transitivity revealing and correcting under pairwise comparisons
Interactive procedure for non-transitivity revealing and correcting under pairwise comparisons
1992,
The paper considers the problem of revealing and correcting non-transitivity in...
An efficient algorithm for the ‘optimal’ stable marriage
An efficient algorithm for the ‘optimal’ stable marriage
1987,
In an instance of size n of the stable marriage problem, each of n men and n women...
Jackson’s Rule for single-machine scheduling: Making a good heuristic better
Jackson’s Rule for single-machine scheduling: Making a good heuristic better
1992,
The authors consider the scheduling problem in which jobs with release dates and...
Artificial intelligence or stochastic relaxation: Simulated annealing challenge
Artificial intelligence or stochastic relaxation: Simulated annealing challenge
1991,
Instead of traditional exhaustive search procedures in logical games programming, a...
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex- and edge-weights on the exterior window
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex- and edge-weights on the exterior window
1991,
Let G=(V,E) be a biconnected planar graph whose vertices and edges have weights. This...
Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem
Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem
1991,
The main difficulty arising in using dynamic programming to solve combinatorial...
A note on the complexity of openshop scheduling problems
A note on the complexity of openshop scheduling problems
1991,
The authors investigate the complexity of openshop scheduling problems. A number of...
Modelling a Telecommunication Common Channel Signalling Network
Modelling a Telecommunication Common Channel Signalling Network
1991,
The design and implementation of a computer package which helps design...
Combinatorial algorithms for the generalized circulation problem
Combinatorial algorithms for the generalized circulation problem
1991,
The authors consider a generalization of the maximum flow problem in which the amounts...
Single-machine scheduling polyhedra with precedence constraints
Single-machine scheduling polyhedra with precedence constraints
1991,
The authors consider nonpreemptive single-machine scheduling subject to precedence...
On an edge ranking problem of trees and graphs
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...
A branch-and-bound method for the fixed charge transportation problem
A branch-and-bound method for the fixed charge transportation problem
1990,
In this paper the authors develop a new conditional penalty for the fixed charge...
A graph minimizing the number of cut-sets with a specified number of edges
A graph minimizing the number of cut-sets with a specified number of edges
1989,
A graph G with n nodes and e edges maximizing the edge-connectivity λ (i.e.,...
A global heuristic for distributed join operations
A global heuristic for distributed join operations
1990,
This paper deals with the problem of query optimization in relational distributed...
Any group is represented by an outerautomorphism group
Any group is represented by an outerautomorphism group
1989,
Recently S. Kojima showed that any finite group is isomorphic to the outerautomorphism...
Directed Steiner tree problem on a graph: Models, relaxations and algorithms
Directed Steiner tree problem on a graph: Models, relaxations and algorithms
1990,
The Steiner problem in graphs is the problem of finding a set of edges (arcs) with...
Set covering and set partitioning: A collection of test problems
Set covering and set partitioning: A collection of test problems
1990,
It is now well established that set covering and set partitioning models play a...
Lower bounds proofs via Voronoi diagrams
Lower bounds proofs via Voronoi diagrams
1989,
It is shown that the large class of geometric problems satisfying an ¦[( n log...
General properties of log2 N-stage switching networks
General properties of log2 N-stage switching networks
1989,
Various kinds of switching networks have been proposed for communications among...
Combinatorial aspects of cropping pattern selection in agriculture
Combinatorial aspects of cropping pattern selection in agriculture
1989,
This paper selects cropping patterns which maximise the return from agricultural land...
A multifaceted heuristic for the orienteering problem
A multifaceted heuristic for the orienteering problem
1989,
The orienteering problem involves the selection of a path between an origin and a...
Papers per page: