Journal: Mathematical Programming (Series A)

Found 506 papers in total
Determination of optimal vertices from feasible solutions in unimodular linear programming
Determination of optimal vertices from feasible solutions in unimodular linear programming
1993,
In this paper the authors consider a linear programming problem with the underlying...
Combining phase I and phase II in a potential reduction algorithm for linear programming
Combining phase I and phase II in a potential reduction algorithm for linear programming
1993,
This paper describes an affine potential reduction algorithm for linear programming...
An active-set strategy in an interior point method for linear programming
An active-set strategy in an interior point method for linear programming
1993,
The paper presents a potential reduction method for linear programming where only the...
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
1993,
The primal projective algorithm for linear programs with unknown optimal objective...
Convergence behavior of interior-point algorithms
Convergence behavior of interior-point algorithms
1993,
The authors show that most interior-point algorithms for linear programming generate a...
Exploiting special structure in a primal-dual path-following algorithm
Exploiting special structure in a primal-dual path-following algorithm
1993,
A primal-dual path-following algorithm that applies directly to a linear program of...
Near boundary behavior of primal-dual potential reduction algorithms for linear programming
Near boundary behavior of primal-dual potential reduction algorithms for linear programming
1993,
This paper is concerned with selection of the - parameter in the primal-dual potential...
A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
1993,
It is shown that a Lagrange multiplier rule involving the Michel-Penot...
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
1993,
This paper is concerned with two well-known families of iterative methods for solving...
On the convergence of iterative methods for symmetric linear complementarity problems
On the convergence of iterative methods for symmetric linear complementarity problems
1993,
The paper proves convergence of the whole sequence generated by any of a large class...
A note on solvability of a class of linear complementarity problems
A note on solvability of a class of linear complementarity problems
1993,
The paper gives a characterization of unique solvability of an infinite family of...
Decomposition in general mathematical programming
Decomposition in general mathematical programming
1993,
In this paper a unifying framework is presented for the generalization of the...
A quadratically convergent -iteration algorithm for linear programming
A quadratically convergent -iteration algorithm for linear programming
1993,
Recently, Ye, Tapia and Zhang demonstrated that Mizuno-Todd-Ye's predictor-corrector...
Structure of a simple scheduling polyhedron
Structure of a simple scheduling polyhedron
1993,
In a one-machine nonpreemptive scheduling problem, the feasible schedules may be...
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
1993,
The paper studies the complexity of computing (or approximating, or bounding) the...
Dual bin packing with items of random sizes
Dual bin packing with items of random sizes
1993,
Given a collection of items and a number of unit size bins, the dual bin packing...
Hierarchical decomposition of symmetric discrete systems by matroid and group theories
Hierarchical decomposition of symmetric discrete systems by matroid and group theories
1993,
An algebraic method is proposed for the hierarchical decomposition of large-scale...
The partition problem
The partition problem
1993,
In this paper the authors describe several forms of the k- partition problem and give...
The basic theorem of complementarity revisited
The basic theorem of complementarity revisited
1993,
The basic theorem of (linear) complementarity was stated in a 1971 paper by B.C. Eaves...
Survivable networks, linear programming relaxations and the parsimonious property
Survivable networks, linear programming relaxations and the parsimonious property
1993,
The authors consider the survivable network design problem-the problem of designing,...
The convex hull of two core capacitated network design problems
The convex hull of two core capacitated network design problems
1993,
The network loading problem (NLP) is a specialized capacitated network design problem...
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
1993,
The authors present strongly polynomial algorithms to find rational and integer flow...
On cuts and matchings in planar graphs
On cuts and matchings in planar graphs
1993,
The paper studies the max cut problem in graphs not contractible to K 5 , and optimum...
A polynomial-time simplex method for the maximum k-flow problem
A polynomial-time simplex method for the maximum k-flow problem
1993,
A generalization of the maximum-flow problem is considered in which every unit of flow...
Papers per page: