Country: Netherlands

Found 18376 papers in total
A study of optimal design under conflict using models of multi-player games
A study of optimal design under conflict using models of multi-player games
1997,
In the broad context of modelling for system design, it is normally assumed that all...
Convex programs with an additional constraint on the product of several convex functions
Convex programs with an additional constraint on the product of several convex functions
1994,
In this paper, we consider a special type of global optimization problem in which a...
A joint chance-constrained programming model with row dependence
A joint chance-constrained programming model with row dependence
1994,
Joint chance-constrained stochastic programming models typically require random row...
Pseudoconvex optimization for a special problem of paint industry
Pseudoconvex optimization for a special problem of paint industry
1994,
A new mathematical programming model is presented for the computer color formulation...
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
1997,
In this paper, we propose a Newton-type method for solving a semismooth reformulation...
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
1997,
A new algorithm for the solution of large-scale nonlinear complementarity problems is...
Solution of monotone complementarity problems with locally Lipschitzian functions
Solution of monotone complementarity problems with locally Lipschitzian functions
1997,
The paper deals with complementarity problems CP( F ), where the underlying function F...
Implementation of a continuation method for normal maps
Implementation of a continuation method for normal maps
1997,
This paper presents an implementation of a nonsmooth continuation method of which the...
Parametrizations of Kojima's system and relations to penalty and barrier functions
Parametrizations of Kojima's system and relations to penalty and barrier functions
1997,
We investigate two homotopies that perturb Kojima's system for describing critical...
Connectionist approaches for solver selection in constrained project scheduling
Connectionist approaches for solver selection in constrained project scheduling
1997,
Solver selection for many complex practical applications is a difficult problem due to...
Sensitivity analysis of composite piecewise smooth equations
Sensitivity analysis of composite piecewise smooth equations
1997,
This paper is a contribution to the sensitivity analysis of piecewise smooth...
A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
1994,
This paper presents a state-space search approach for parallel processor scheduling...
Strengthening Gilmore's bound for the quadratic assignment problem
Strengthening Gilmore's bound for the quadratic assignment problem
1994,
Finding bounds for the quadratic assignment problem is important as part of some...
Incorporating preference information into multi-objective scheduling
Incorporating preference information into multi-objective scheduling
1994,
Multi-criteria scheduling problems have typically been formulated with an objective of...
Minimization of a quadratic pseudo-Boolean function
Minimization of a quadratic pseudo-Boolean function
1994,
We present a branch and bound algorithm for minimizing a quadratic pseudo-Boolean...
The stochastic single machine scheduling problem with earliness and tardiness costs
The stochastic single machine scheduling problem with earliness and tardiness costs
1994,
This paper studies the static single machine scheduling problem with earliness and...
Necessary and sufficient conditions of unacceptable solutions in NLP discriminant analysis
Necessary and sufficient conditions of unacceptable solutions in NLP discriminant analysis
1994,
Over the last ten years, there has been a growing interest in the application of...
On the complexity of preemptive openshop scheduling problems
On the complexity of preemptive openshop scheduling problems
1994,
We investigate the complexity status of the preemptive openshop scheduling problem....
On piecewise quadratic Newton and trust region problems
On piecewise quadratic Newton and trust region problems
1997,
Some recent algorithms for nonsmooth optimization require solutions to certain...
Scheduling a two-stage hybrid flowshop with separable setup and removal times
Scheduling a two-stage hybrid flowshop with separable setup and removal times
1994,
This paper considers the two-stage flowshop scheduling problem where each stage...
The Travelling Salesman Problem with pick-up and delivery
The Travelling Salesman Problem with pick-up and delivery
1994,
Demand points for pick-up and delivery are located in the plane. A single vehicle of a...
Job shop leadtime requirements under conditions of controlled delivery performance
Job shop leadtime requirements under conditions of controlled delivery performance
1994,
A model that facilities setting due dates on the basis of forecasted flowtimes and...
Adjustment of heads and tails for the job-shop problem
Adjustment of heads and tails for the job-shop problem
1994,
The efficiency of recent enumerative methods for the job-shop problem crucially...
The three-machine flow-shop problem with arbitrary precedence relations
The three-machine flow-shop problem with arbitrary precedence relations
1994,
The scheduling problem n /3/F/ C max with arbitrary precedence constraints between the...
Papers per page: