Journal: Mathematical Programming (Series A)

Found 506 papers in total
A globally convergent primal-dual interior point algorithm for convex programming
A globally convergent primal-dual interior point algorithm for convex programming
1994,
This paper studies the global convergence of a large class of primal-dual interior...
A row-action method for convex programming
A row-action method for convex programming
1994,
The authors present a new method for minimizing a strictly convex function subject to...
Solving cone-constrained convex programs by differential inclusions
Solving cone-constrained convex programs by differential inclusions
1994,
A differential inclusion is designed for solving cone-constrained convex programs. The...
Facial reduction in partially finite convex programming
Facial reduction in partially finite convex programming
1994,
The paper considers the problem of minimizing an extended-value convex function on a...
An interior-point method for fractional programs with convex constraints
An interior-point method for fractional programs with convex constraints
1994,
The authors present an interior-point method for a class of fractional programs with...
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
1994,
Properties of several dual characteristics of the multidimensional knapsack problem...
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
1994,
The authors report on improved practical algorithms for lattice basis reduction. They...
A distance constrained p-facility location problem on the real line
A distance constrained p-facility location problem on the real line
1994,
Let V={v 1 ,...,v n } be a set of n points on the real line (existing facilities). The...
A bound-improving approach to discrete programming problems
A bound-improving approach to discrete programming problems
1994,
This note deals with the extension of the bound-improving sequence idea to general...
A computational study of graph partitioning
A computational study of graph partitioning
1994,
Let G=(N,E) be an edge-weighted undirected graph. The graph partitioning problem is...
The complex of maximal lattice free simplices
The complex of maximal lattice free simplices
1994,
The simplicial complex K(A) is defined to be the collection of simplices, and their...
Bounded knapsack sharing
Bounded knapsack sharing
1994,
A bounded knapsack sharing problem is a maximim or minimax mathematical programming...
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
1994,
This paper considers the inverse shortest paths problem where arc costs are subject to...
The Steiner tree polytope and related polyhedra
The Steiner tree polytope and related polyhedra
1994,
The paper considers the vertex-weighted version of the undirected Steiner tree...
Tree polytope on 2-trees
Tree polytope on 2-trees
1994,
The authors give a complete polyhedral characterization of the tree polytope (convex...
Pivoting to normalize a basic matrix
Pivoting to normalize a basic matrix
1993,
Given a matrix in basic form a sequence of pivots is described which brings the matrix...
Examples of max-flow and min-cut problems with duality gaps in continuous networks
Examples of max-flow and min-cut problems with duality gaps in continuous networks
1994,
Strang gave a method to establish a max-flow min-cut theorem in a domain of a...
A deep cut ellipsoid algorithm for convex programming: Theory and applications
A deep cut ellipsoid algorithm for convex programming: Theory and applications
1994,
This paper proposes a deep cut version of the ellipsoid algorithm for solving a...
An approximation algorithm for the generalized assignment problem
An approximation algorithm for the generalized assignment problem
1993,
The generalized assignment problem can be viewed as the following problem of...
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...
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...
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)...
Papers per page: