Journal: Computational Optimization and Applications

Found 579 papers in total
Quadratic and superlinear convergence of the Huschens method for nonlinear least squares problems
Quadratic and superlinear convergence of the Huschens method for nonlinear least squares problems
1998,
This paper is concerned with quadratic and superlinear convergence of structured...
Feature minimization within decision trees
Feature minimization within decision trees
1998,
Decision trees for classification can be constructed using mathematical programming....
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998,
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
The minimum covering lpb-hypersphere problem
The minimum covering lpb-hypersphere problem
1998,
The minimum covering hypersphere problem is defined as to find a hypersphere of...
On the existence and convergence of the central path for convex programming and some duality results
On the existence and convergence of the central path for convex programming and some duality results
1998,
This paper gives several equivalent conditions which guarantee the existence of the...
Finding postal carrier walk paths in mixed graphs
Finding postal carrier walk paths in mixed graphs
1998,
The postman problem requires finding a lowest cost tour in a connected graph that...
Global optimization techniques for solving the general quadratic integer programming problem
Global optimization techniques for solving the general quadratic integer programming problem
1998,
We consider the problem of minimizing a general quadratic function over a polytope in...
A parallel interior point method and its application to facility location problems
A parallel interior point method and its application to facility location problems
1998,
We present a parallel interior point algorithm to solve block structured linear...
A special class of set covering problems
A special class of set covering problems
1996,
A class of set covering problems is being introduced. This class is obtained from...
Constructing the value function for an Integer Linear Program over a Cone
Constructing the value function for an Integer Linear Program over a Cone
1996,
The value function of an Integer Program is the optimal objective value expressed as a...
New constructs for the description of combinatorial optimization problems in algebraic modeling languages
New constructs for the description of combinatorial optimization problems in algebraic modeling languages
1996,
Algebraic languages are at the heart of many successful optimization modeling systems,...
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
1996,
This article deals with a method to compute bounds in algorithms for solving the...
Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming
Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming
1997,
This paper presents a new surrogate constraint analysis that gives rise to a family of...
A note on reducing the number of variables in Integer Programming problems
A note on reducing the number of variables in Integer Programming problems
1997,
A necessary and sufficient condition for identification of dominated columns, which...
A truncated exponential algorithm for the lightly constrained assignment problem
A truncated exponential algorithm for the lightly constrained assignment problem
1997,
This paper presents a truncated branch-and-bound algorithm to obtain a near optimal...
Multiple centrality corrections in a primal–dual method for linear programming
Multiple centrality corrections in a primal–dual method for linear programming
1996,
A modification of the (infeasible) primal-dual interior point method is developed. The...
Sparse linear least squares problems in optimization
Sparse linear least squares problems in optimization
1997,
Numerical and computational aspects of direct methods for large and sparse least...
Nondegeneracy of polyhedra and linear programs
Nondegeneracy of polyhedra and linear programs
1997,
This paper deals with nondegeneracy of polyhedra and linear programming (LP) problems....
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
1997,
We are motivated by the problem of constructing a primal–dual barrier function...
Recovery from numerical instability during basis reinversion
Recovery from numerical instability during basis reinversion
1997,
Most of the preassigned pivot agenda algorithms that extend the Hellerman–Rarick...
On the convergence rate of Newton interior-point methods in the absence of strict complementarity
On the convergence rate of Newton interior-point methods in the absence of strict complementarity
1996,
In the absence of strict complementarity, Monteiro and Wright proved that the...
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...
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...
Papers per page: