Journal: Discrete Applied Mathematics

Found 533 papers in total
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
1999,
We consider the problem of scheduling a set of jobs on a single machine with the...
Earliness and tardiness scheduling problems on a batch processor
Earliness and tardiness scheduling problems on a batch processor
1999,
In this paper, we discuss the problem of scheduling n jobs on a batch processor to...
On some properties of DNA graphs
On some properties of DNA graphs
1999,
Molecular biology, which aims to study DNA and protein structure and functions, has...
Pattern minimisation in cutting stock problems
Pattern minimisation in cutting stock problems
1999,
In the cutting stock pattern minimisation problem, we wish to satisfy demand for...
Mixed logical–linear programming
Mixed logical–linear programming
1999,
Mixed logical–linear programming (MLLP) is an extension of mixed...
Partitions and network reliability
Partitions and network reliability
1999,
The all-terminal reliability and K -terminal reliability of networks are often...
Best second order bounds for two-terminal network reliability with dependent edge failures
Best second order bounds for two-terminal network reliability with dependent edge failures
1999,
Given a network modeled by a probabilistic graph G = ( V , E ) with bounds on...
On the complexity of linear programming in the Blum–Shub–Smale model
On the complexity of linear programming in the Blum–Shub–Smale model
1999,
We consider the Blum–Shub–Smale model of computation over the reals. It...
Tree- and forest-perfect graphs
Tree- and forest-perfect graphs
1999,
Two graphs G and H with the same vertex set V are P 4 -isomorphic if there exists a...
The Steiner ratio of ℒd2k
The Steiner ratio of ℒd2k
1999,
Let ℒ d 2k be the d -dimensional space with 2 k -norm. Given a finite set N of...
Note on a helicopter search problem on graphs
Note on a helicopter search problem on graphs
1999,
We consider a search game on a graph in which one cop in a helicopter flying from...
Semidefinite programming relaxations for the graph partitioning problem
Semidefinite programming relaxations for the graph partitioning problem
1999,
A new semidefinite programming, SDP, relaxation for the general graph partitioning...
Discrete Applied Mathematics
Discrete Applied Mathematics
1999,
In this paper the performance of the Hamming-based Reactive Tabu Search (H-RTS)...
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
1999,
The rectilinear Steiner tree problem is to find a minimum-length rectilinear...
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
1999,
Cell flipping in VLSI design is an operation in which some of the cells are replaced...
On the cut-off point for combinatorial group testing
On the cut-off point for combinatorial group testing
1999,
The following problem is known as group testing problem for n objects. Each object can...
A combinatorial problem in database security
A combinatorial problem in database security
1999,
Let A be a k -dimensional matrix of size d 1 × ··· ×...
Underdiagonal lattice paths with unrestricted steps
Underdiagonal lattice paths with unrestricted steps
1999,
We use some combinatorial methods to study underdiagonal paths (on the Z 2 lattice)...
On the nonexistence of extremal self-dual codes
On the nonexistence of extremal self-dual codes
1999,
Most of the known nonexistence results for extremal self-dual codes were obtained by...
Efficient m-ary balanced codes
Efficient m-ary balanced codes
1999,
An m -ary balanced code with r check digits and k information digits is a code over...
Optimal layout of edge-weighted forests
Optimal layout of edge-weighted forests
1999,
The layout problem for trees with weighted edges is motivated by the design of...
A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays
A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays
1999,
In this paper, we consider the yield enhancement of programmable structures by logical...
Induced permutation automata and coverings of strongly connected automata
Induced permutation automata and coverings of strongly connected automata
1999,
Let A = (S, Σ, N) be a strongly connected automaton and e be a minimal...
On the complexity of postoptimality analysis of 0/1 programs
On the complexity of postoptimality analysis of 0/1 programs
1999,
In this paper we address the complexity of postoptimality analysis of 0/1 programs...
Papers per page: