Country: Netherlands

Found 18376 papers in total
Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
1995,
The descent auxiliary problem method allows one to find the solution of minimization...
A parallel algorithm for multiple objective linear programs
A parallel algorithm for multiple objective linear programs
1997,
This paper presents an ADBASE-based parallel algorithm for solving multiple objective...
Use of reference points for solving multiple objective nonlinear programming problems
Use of reference points for solving multiple objective nonlinear programming problems
1995,
The paper discusses a scalar problem that uses a reference point for solving the...
A direct approach for finding all efficient solutions for multiobjective programming problems
A direct approach for finding all efficient solutions for multiobjective programming problems
1995,
In this paper, we present a new approach for finding all efficient solutions for...
A cooperative fuzzy game theoretic approach to multiple objective design optimization
A cooperative fuzzy game theoretic approach to multiple objective design optimization
1995,
The utility and applicability of cooperative game theory in an engineering design...
Duality with multiple criteria and multiple resources
Duality with multiple criteria and multiple resources
1996,
We consider an extension of a linear model studied by Gale, Kuhn and Tucker (GKT) for...
A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
1997,
This paper reports on the development of a very efficient method for partitioning the...
A class of smoothing functions for nonlinear and mixed complementarity problems
A class of smoothing functions for nonlinear and mixed complementarity problems
1996,
We propose a class of parametric smooth functions that approximate the fundamental...
An intelligent interactive Project Management Support System
An intelligent interactive Project Management Support System
1995,
The paper presents a general framework for developing complex systems for tasks like...
On the resolution of monotone complementarity problems
On the resolution of monotone complementarity problems
1996,
A reformulation of the nonlinear complementarity problem (NCP) as an unconstrained...
Numerical experiments in semi-infinite programming
Numerical experiments in semi-infinite programming
1996,
A quasi-Newton algorithm for semi-infinite programming using an L ∞ exact...
A comparison of large scale mixed complementarity problem solvers
A comparison of large scale mixed complementarity problem solvers
1997,
This paper provides a means for comparing various computer codes for solving large...
The modified integer round-up property of the one-dimensional cutting stock problem
The modified integer round-up property of the one-dimensional cutting stock problem
1995,
A linear integer minimization problem (IP) has the modified integer round-up property...
Impact of partial separability on large-scale optimization
Impact of partial separability on large-scale optimization
1997,
ELSO is an environment for the solution of large-scale optimization problems. With...
CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem
CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem
1995,
In this paper a problem generator for the Standard One-dimensional Cutting Stock...
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
1997,
This paper considers the number of inner iterations required per outer iteration for...
An LP-based approach to a two-stage cutting stock problem
An LP-based approach to a two-stage cutting stock problem
1995,
This paper describes a linear programming model for a two-stage cutting stock problem...
Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
1997,
Recently, a very general class of truncated Newton methods has been proposed for...
Establishing the optimality of sequencing heuristics for cutting stock problems
Establishing the optimality of sequencing heuristics for cutting stock problems
1995,
Cutting stock problems typically involve the generation of feasible cutting patterns...
Sequential quadratic programming methods for large-scale problems
Sequential quadratic programming methods for large-scale problems
1997,
Sequential quadratic programming (SQP) methods are the method of choice when solving...
An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
1995,
This work is concerned with unconstrained two-dimensional non-guillotine cutting...
Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
1997,
In this paper, a new nonmonotone Broyden–Fletcher–Goldfarb–Shanno...
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
1995,
An efficient heuristic for solving two-dimensional knapsack problems is proposed. The...
Metric-based symmetric rank-one updates
Metric-based symmetric rank-one updates
1997,
Metric-based symmetric rank-one (SR1) updates which are stabilized by a variational...
Papers per page: