Country: Netherlands

Found 18376 papers in total
A review of artificial intelligence-based job-shop scheduling systems
A review of artificial intelligence-based job-shop scheduling systems
1991,
A comparative review and assessment of knowledge-based scheduling systems for the job...
A cutting plane method for the windy postman problem
A cutting plane method for the windy postman problem
1992,
In this paper the authors describe a cutting plane algorithm for the (NP-hard) windy...
Games, equations and dot-depth-two monoids
Games, equations and dot-depth-two monoids
1992,
Given any finite alphabet A and positive integers m 1 ,...,m k , congruences on...
On the integral plane two-commodity flow problem
On the integral plane two-commodity flow problem
1992,
The authors consider in this note the maximum integral two-commodity flow problem in...
Measure theoretic approach to the classification of cellular automata
Measure theoretic approach to the classification of cellular automata
1992,
Each measurable transformation that commutes with a shift on the set of configurations...
One-story buildings as tensegrity frameworks (Part III)
One-story buildings as tensegrity frameworks (Part III)
1992,
The minimum number of diagonal cables to make a one-story building infinitesimally...
Application of production scheduling methods to external and internal audit scheduling
Application of production scheduling methods to external and internal audit scheduling
1991,
This paper deals with the problem of labor staffing in a service organization. The...
The communication complexity of interval orders
The communication complexity of interval orders
1992,
The communication complexity of interval orders is studied within the following model....
Bounding the distribution of project duration in PERT networks
Bounding the distribution of project duration in PERT networks
1992,
The PERT model of a project composed of m activities whose durations are independent...
An O(n) bound for the diameter of transshipment polytopes
An O(n) bound for the diameter of transshipment polytopes
1992,
The diameter of any transshipment polytope associated to the complete directed graph...
Set partition by globally optimized cluster seed points
Set partition by globally optimized cluster seed points
1991,
A new method is proposed for solving set partition (clustering) problems: the...
Communication complexity of two decision problems
Communication complexity of two decision problems
1992,
The authors observe that the communication complexity for deciding whether two...
An improved partial solution to the Task Assignment and Multiway Cut problems
An improved partial solution to the Task Assignment and Multiway Cut problems
1992,
The Task Assignment problem consists of assigning tasks to processors in order to...
An interactive multi-objective gradient search
An interactive multi-objective gradient search
1992,
In recent years there has been much interest in developing interactive algorithms for...
Efficient fault-tolerant fixed routings on -connected digraphs
Efficient fault-tolerant fixed routings on -connected digraphs
1992,
Consider a directed communication network G in which a limited number of directed link...
A relaxation column signature method for assignment problems
A relaxation column signature method for assignment problems
1991,
A recent computational study on algorithms for assignment problems revealed that the...
Probabilistic analysis of the generalised assignment problem
Probabilistic analysis of the generalised assignment problem
1992,
The authors analyse the generalised assignment problem under the assumption that all...
Separable convex programs with ratio constraints over a directed tree
Separable convex programs with ratio constraints over a directed tree
1992,
This paper describes a class of separable convex programs with ratio constraints over...
Minimum Principle Sufficiency
Minimum Principle Sufficiency
1992,
The authors characterize the property of obtaining a solution to a convex program by...
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
1992,
The authors study convex programs that involve the minimization of a convex function...
Partially finite convex programming, Part II: Explicit lattice models
Partially finite convex programming, Part II: Explicit lattice models
1992,
In Part I of this work the authors derived a duality theorem for partially finite...
Generalization of Slater’s constraint qualification for infinite convex programs
Generalization of Slater’s constraint qualification for infinite convex programs
1992,
where g=(g 1 ,g 2 ) and S=S 1 ×S 2 , S i are convex cones, i=1,2 C is a convex...
Optimality conditions for non-finite valued convex composite functions
Optimality conditions for non-finite valued convex composite functions
1992,
Burke has recently developed second-order necessary and sufficient conditions for...
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
1992,
This paper shows, by means of an operator called a splitting operator, that the...
Papers per page: