Country: Netherlands

Found 18376 papers in total
Solving symmetric indefinite systems in an interior-point method for linear programming
Solving symmetric indefinite systems in an interior-point method for linear programming
1993,
The authors describe an implementation of a primal-dual path following method for...
Load balancing in the parallel optimization of block-angular linear programs
Load balancing in the parallel optimization of block-angular linear programs
1993,
Decomposition algorithms for block-angular linear programs give rise to a natural,...
On the big
On the big
1993,
When the affine scaling algorithm is applied to a linear program, an artificial linear...
A primal-dual affine-scaling potential-reduction algorithm for linear programming
A primal-dual affine-scaling potential-reduction algorithm for linear programming
1993,
The authors propose a potential-reduction algorithm which always uses the primal-dual...
On the number of iterations of Karmarkar’s algorithm for linear programming
On the number of iterations of Karmarkar’s algorithm for linear programming
1993,
Karmarkar’s algorithm for linear programming was published in 1984, and it is...
Finding an interior point in the optimal face of linear programs
Finding an interior point in the optimal face of linear programs
1993,
The authors study the problem of finding a point in the relative interior of the...
FUZMAR: An approach to aggregating market research data based on fuzzy reasoning
FUZMAR: An approach to aggregating market research data based on fuzzy reasoning
1994,
The authors introduce an approach for validating models which contain variables taking...
A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
1993,
Since Dantzig-Wolfe’s pioneering contribution, the decomposition approach using...
Convergence of some algorithms for convex minimization
Convergence of some algorithms for convex minimization
1993,
The authors present a simple and unified technique to establish convergence of various...
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
1993,
In a recent paper, Shaw and Goldfarb show that a version of the standard form...
Nonlinear complementarity as unconstrained and constrained minimization
Nonlinear complementarity as unconstrained and constrained minimization
1993,
The nonlinear complementarity problem is cast as an unconstrained minimization problem...
A rapidly convergent five-point algorithm for univariate minimization
A rapidly convergent five-point algorithm for univariate minimization
1993,
This paper presents an algorithm for minimizing a function of one variable which uses...
A technique for speeding up the solution of the Lagrangean dual
A technique for speeding up the solution of the Lagrangean dual
1994,
The authors propose techniques for the solution of the LP relaxation and the...
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
1994,
The linear complementarity problem is to find nonnegative vectors which are affinely...
On quadratic and
On quadratic and
1993,
Recently several new results have been developed for the asymptotic (local)...
The least element property of center location on tree networks with applications to distance and precedence constrained problems
The least element property of center location on tree networks with applications to distance and precedence constrained problems
1993,
In the classical p- center location model on a network there is a set of customers,...
Laplacian eigenvalues and the maximum cut problem
Laplacian eigenvalues and the maximum cut problem
1993,
The authors introduce and study an eigenvalue upper bound ℝrsquo;(G) on the...
Efficient enumeration of the vertices of polyhedra associated with network LPs
Efficient enumeration of the vertices of polyhedra associated with network LPs
1994,
Algorithms are given to list the vertices of polyhedra associated with network linear...
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
1994,
A new generalized Farkas theorem of the alternative is presented for systems involving...
Representations of quasi-Newton matrices and their use in limited memory methods
Representations of quasi-Newton matrices and their use in limited memory methods
1994,
The authors derive compact representations of BFGS and symmetric rank-one matrices for...
Global minimization by reducing the duality gap
Global minimization by reducing the duality gap
1994,
The authors derive a general principle demonstrating that by partitioning the feasible...
Inexact subgradient methods with applications in stochastic programming
Inexact subgradient methods with applications in stochastic programming
1994,
In many instances, the exact evaluation of an objective function and its subgradients...
Using copositivity for global optimality criteria in concave quadratic programming problems
Using copositivity for global optimality criteria in concave quadratic programming problems
1993,
In this note the authors specify a necessary and sufficient condition for global...
Staircase transportation problems with superadditive rewards and cumulative capacities
Staircase transportation problems with superadditive rewards and cumulative capacities
1993,
A cumulative-capacitated transportation problem is studied. The supply nodes and...
Papers per page: