Journal: Discrete Applied Mathematics

Found 533 papers in total
Why should biconnected components be identified first
Why should biconnected components be identified first
1993,
Most graph optimization problems are solved on each connected component of the graph...
A fast randomized algorithm for partitioning a graph into paths of fixed length
A fast randomized algorithm for partitioning a graph into paths of fixed length
1993,
A randomized extension-rotation algorithm is presented to partition an undirected...
Efficient labelling algorithms for the maximum noncrossing matching problem
Efficient labelling algorithms for the maximum noncrossing matching problem
1993,
Consider a bipartite graph; let’s suppose the origin nodes and the destination...
Hexagonal systems with fixed bonds
Hexagonal systems with fixed bonds
1993,
In this paper the authors give an O( n 2 ) algorithm to determine fixed bonds and...
Computing the throughput of a network with dedicated lines
Computing the throughput of a network with dedicated lines
1993,
Suppose that the authors wish to transmit many messages from a node of a network to...
Note on combinatorial optimization with max-linear objective functions
Note on combinatorial optimization with max-linear objective functions
1993,
The authors consider combinatorial optimization problems with a feasible solution set...
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Adjacency of the best and second best valued solutions in combinatorial optimization problems
1993,
The authors say that a polytope satisfies the strong adjacency property if every best...
Efficient reformulation for 0-1 programs-Methods and computational results
Efficient reformulation for 0-1 programs-Methods and computational results
1993,
The authors introduce two general methods for 0-1 program reformulation. The present...
Lagrangean methods for 0-1 quadratic problems
Lagrangean methods for 0-1 quadratic problems
1993,
Three Lagrangean methods for 0-1 quadratic programming are presented. The first one...
On the complexity of a special basis problem in LP
On the complexity of a special basis problem in LP
1993,
In a linear program in standard form, the paper shows that the problem of finding a...
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
1993,
The problem the authors consider is that of scheduling n unit length tasks on...
Sequential and parallel local search for the time-constrained traveling salesman problem
Sequential and parallel local search for the time-constrained traveling salesman problem
1993,
Local search has proven to be an effective solution approach for the traveling...
The complexity of one-machine batching problems
The complexity of one-machine batching problems
1993,
Batching problems are combinations of sequencing and partitioning problems. For each...
A note on generalizing the maximum lateness criterion for scheduling
A note on generalizing the maximum lateness criterion for scheduling
1993,
This paper considers generalizing the objective criterion of minimizing maximum...
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
1993,
The authors discuss the problem of scheduling a set of n independent jobs on m...
A result of Vapnik with applications
A result of Vapnik with applications
1993,
A new proof of a result due to Vapnik is given. Its implications for the theory of PAC...
Locating service centers with precedence constraints
Locating service centers with precedence constraints
1993,
Isotonic regression models have been used extensively with various objective...
A unifying location model on tree graphs based on submodularity properties
A unifying location model on tree graphs based on submodularity properties
1993,
Let ℱ be the collection of nonempty subtrees of a given tree T. Each subtree is...
A new class of nonbinary codes meeting the Griesmer bound
A new class of nonbinary codes meeting the Griesmer bound
1993,
A new class of codes over GF(q l ) that meet the Griesmer bound are constructed in a...
The complexity of domination problems in circle graphs
The complexity of domination problems in circle graphs
1993,
Circle graphs are the intersection graphs of chords of a circle. This paper shows that...
Studies on hypergraphs I: Hyperforests
Studies on hypergraphs I: Hyperforests
1993,
The theory of hyperforests has many applications in fields ranging from mathematical...
Distributions on bicoloured binary trees arising from the principle of parsimony
Distributions on bicoloured binary trees arising from the principle of parsimony
1993,
The distribution of binary trees with bicoloured endpoints under the taxonomic...
The optimal unicyclic graphs for pair-connected reliability
The optimal unicyclic graphs for pair-connected reliability
1993,
The authors consider the standard network reliability model in which each edge of a...
Fast information sharing in a complete network
Fast information sharing in a complete network
1993,
The authors consider the problem of complete information dissemination among n...
Papers per page: