Country: Netherlands

Found 18376 papers in total
A dynamic lot sizing model with exponential machine breakdowns
A dynamic lot sizing model with exponential machine breakdowns
1997,
This paper addresses the dynamic lot sizing model with the assumption that the...
A dual ascent approach to the fixed-charge capacitated network design problem
A dual ascent approach to the fixed-charge capacitated network design problem
1996,
In this paper we consider the problem of constructing a network over which a number of...
Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures
Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures
1997,
In this study, the variance of the throughput of an N -station production line with no...
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
1997,
This paper deals with a two-machine preemptive openshop system processing a set of...
Multicommodity flow models for spanning trees with hop constraints
Multicommodity flow models for spanning trees with hop constraints
1996,
In this paper we compare the linear programming relaxations of undirected and directed...
Computational investigations of maximum flow algorithms
Computational investigations of maximum flow algorithms
1997,
The maximum flow algorithm is distinguished by the long line of successive...
Strongly polynomial dual simplex methods for the maximum flow problem
Strongly polynomial dual simplex methods for the maximum flow problem
1998,
This paper presents dual network simplex algorithms that require at most 2 nm pivots...
Models for multi-path covering-routing problems
Models for multi-path covering-routing problems
1998,
Research on covering has concentrated on problems where the facilities are small in...
The hierarchical network design problem with multiple primary paths
The hierarchical network design problem with multiple primary paths
1997,
In this paper we develop a suboptimal solution for the hierarchical network design...
MARS – a multistart adaptive random search method for global constrained optimization in engineering applications
MARS – a multistart adaptive random search method for global constrained optimization in engineering applications
1998,
A multistart, step-controlled random search algorithm for global, constrained...
Design optimization for robustness using quadrature factorial models
Design optimization for robustness using quadrature factorial models
1998,
This paper describes a robust optimization methodology for designs involving either...
Multi-objective optimization over convex disjunctive feasible sets using reference points
Multi-objective optimization over convex disjunctive feasible sets using reference points
1997,
In this paper we consider the Multiple Objective Optimization Problem, where concave...
New polynomial bounds for matroidal knapsacks
New polynomial bounds for matroidal knapsacks
1996,
The Matroidal Knapsack Problem (MK) consists in finding the maximum weight basis for a...
A method for convex curve approximation
A method for convex curve approximation
1997,
In this paper, a new sandwich method is introduced to approximate a convex curve in R...
Approximating probability density functions and their convolutions using orthogonal polynomials
Approximating probability density functions and their convolutions using orthogonal polynomials
1996,
This paper describes and tests methods for piecewise polynomial approximation of...
A combined relaxation method for variational inequalities with nonlinear constraints
A combined relaxation method for variational inequalities with nonlinear constraints
1998,
A simple iterative method for solving variational inequalities with a set-valued,...
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
1998,
An example of an SDP (semidefinite program) exhibits a substantial difficulty in...
A reduction method for variational inequalities
A reduction method for variational inequalities
1998,
This paper explains a method by which the number of variables in a variational...
Optimization model for construction project durations using a multistage decision process
Optimization model for construction project durations using a multistage decision process
1998,
The optimization of project duration is often performed during the planning stage of a...
Modelling of augmented makespan assignment problems: Computational experience of applying integer presolve at the modelling stage
Modelling of augmented makespan assignment problems: Computational experience of applying integer presolve at the modelling stage
1998,
An Augmented Makespan Assignment Problem (AMAP), which is a variation of the...
An extended formulation approach to the edge-weighted maximal clique problem
An extended formulation approach to the edge-weighted maximal clique problem
1996,
We consider an extended formulation approach to the edge-weighted maximal clique...
On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems – an improved approach
On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems – an improved approach
1997,
The use of asymptotic forms of the Boolean matrix for grouping machines and parts is...
Mean value cross decomposition applied to integer programming problems
Mean value cross decomposition applied to integer programming problems
1997,
The mean value cross decomposition method for linear programming problems is a...
A global mixed-integer linear programming model for flexible manufacturing system scheduling
A global mixed-integer linear programming model for flexible manufacturing system scheduling
1997,
Flexible manufacturing systems (FMS) require intelligent scheduling strategies to...
Papers per page: