Journal: Discrete Applied Mathematics

Found 533 papers in total
Stochastic scheduling and forwards induction
Stochastic scheduling and forwards induction
1995,
The paper considers the problem ( J,¦) ) of allocating a single machine to the...
Nearly on line scheduling of preemptive independent tasks
Nearly on line scheduling of preemptive independent tasks
1995,
The paper discusses the problem of scheduling preemptive independent tasks, subject to...
Note on scheduling intervals on-line
Note on scheduling intervals on-line
1995,
An optimal on-line algorithm is presented for the following optimization problem,...
Lower bounds for the job-shop scheduling problem on multi-purpose machines
Lower bounds for the job-shop scheduling problem on multi-purpose machines
1995,
The job-shop problem on multi-purpose machines (MPM job-shop problem) arises in the...
New results on the completion time variance minimization
New results on the completion time variance minimization
1995,
A single machine scheduling problem where the objective is to minimize the variance of...
Insertion techniques for the heuristic solution of the job shop problem
Insertion techniques for the heuristic solution of the job shop problem
1995,
In this paper the authors deal with the heuristic solution of the classical job shop...
Preemptive scheduling with variable profile, precedence constraints and due dates
Preemptive scheduling with variable profile, precedence constraints and due dates
1995,
This paper is concerned with the problem of scheduling preemptive tasks subject to...
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
1995,
The paper considers a two machine flow shop scheduling problem with no wait in...
Discrete infinite transportation problems
Discrete infinite transportation problems
1995,
The finite classical transportation problem is extended to an infinite one having a...
Trapezoidal matrices and the bottleneck assignment problem
Trapezoidal matrices and the bottleneck assignment problem
1995,
The research of equation systems, linear under operations of minimum and maximum, gave...
Dominating Cartesian products of cycles
Dominating Cartesian products of cycles
1995,
Let be the domination number of a graph and let   denote the Cartesian product of...
Algorithms for weakly triangulated graphs
Algorithms for weakly triangulated graphs
1995,
The authors present improved algorithms for the recognition and the weighted versions...
A polynomial approximation scheme for the subset sum problem
A polynomial approximation scheme for the subset sum problem
1995,
The subset sum problem is defined as: given a set of n+1 positive integers, a 1...
How do I marry thee? Let me count the ways
How do I marry thee? Let me count the ways
1995,
A stable marriage problem of size 2 n is constructed which contains stable matchings....
Some democratic secret sharing schemes
Some democratic secret sharing schemes
1995,
The paper considers the problem of constructing secret sharing schemes without the...
Matrices generated by semilattices
Matrices generated by semilattices
1995,
The paper gives a characterization of 0-1 matrices M which are generated by...
Regularity of matrices in min-algebra and its time-complexity
Regularity of matrices in min-algebra and its time-complexity
1995,
Let be a linearly ordered, commutative group and be defined by for all . Extend to...
The arborescence-realization problem
The arborescence-realization problem
1995,
A {0,1}-matrix M is arborescence graphic if there exists an arborescence T such that...
Vertex-symmetric digraphs with small diameter
Vertex-symmetric digraphs with small diameter
1995,
There is increasing interest in the design of dense vertex-symmetric graphs and...
Expanding and forwarding
Expanding and forwarding
1995,
Expanding parameters of graphs (magnification constant, edge and vertex cutset...
Two remarks on ‘Expanding and Forwarding’ by P. Solé
Two remarks on ‘Expanding and Forwarding’ by P. Solé
1995,
The paper makes two remarks on a paper of Solé. First, it improves his lower...
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
1995,
Three regions arising as surrogates in certain network design problems are the...
Adjacency on combinatorial polyhedra
Adjacency on combinatorial polyhedra
1995,
This paper shows some useful properties of the adjacency structures of a class of...
A random polynomial time algorithm for well-rounding convex bodies
A random polynomial time algorithm for well-rounding convex bodies
1995,
The authors present a random polynomial time algorithm for well-rounding convex bodies...
Papers per page: