Country: Netherlands

Found 18376 papers in total
Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
1996,
This paper considers a single machine scheduling problem with the constraints of...
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...
Fuzzy job shop scheduling
Fuzzy job shop scheduling
1996,
This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness...
The elements and functions of hierarchical scheduling system of order production
The elements and functions of hierarchical scheduling system of order production
1996,
The purpose of this study is to develop a more flexible and effective scheduling...
Algorithms for weakly triangulated graphs
Algorithms for weakly triangulated graphs
1995,
The authors present improved algorithms for the recognition and the weighted versions...
Makespan comparison between resequencing and switching in a dynamic manufacturing environment
Makespan comparison between resequencing and switching in a dynamic manufacturing environment
1996,
Makespan performance capabilities, using dispatching, fixed sequencing, resequencing...
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...
Improving the complexities of approximation algorithms for optimization problems
Improving the complexities of approximation algorithms for optimization problems
1995,
A procedure to improve the lower and upper bound for the optimal objective function...
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...
One-third-integrality in the max-cut problem
One-third-integrality in the max-cut problem
1995,
Given a graph , the metric polytope is defined by the inequalities for , odd, C cycle...
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
1995,
The Task Assignment Problem (TAP) arises in distributed computing environments and is...
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...
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
1993,
Multicommodity extended formulations of single source uncapacitated fixed charge...
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...
Configuring both backbone and logical networks of a reconfigurable network with link failures allowed
Configuring both backbone and logical networks of a reconfigurable network with link failures allowed
1996,
This paper considers a problem of configuring both backbone and logical networks in a...
NETPAD: An interactive graphics system for network modeling and optimization
NETPAD: An interactive graphics system for network modeling and optimization
1995,
The practical and theoretical importance of network models and algorithms is clearly...
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
1995,
Consider the polyhedron represented by the dual of the LP formulation of the maximum...
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...
Papers per page: