Journal: Mathematical Programming

Found 797 papers in total
Nonlinear rescaling vs. smoothing technique in convex optimization
Nonlinear rescaling vs. smoothing technique in convex optimization
2002,
We introduce an alternative to the smoothing technique approach for constrained...
A BFGS interior point algorithm for solving strongly convex optimization problems with feasibility – enforced by an exact penalty approach
A BFGS interior point algorithm for solving strongly convex optimization problems with feasibility – enforced by an exact penalty approach
2002,
This paper introduces and analyses a new algorithm for minimizing a convex function...
Improved sorting-based procedure for integer programming
Improved sorting-based procedure for integer programming
2002,
Recently, Cornuéjols and Dawande have considered a special class of 0–1...
Polyhedral results for the edge capacity polytope
Polyhedral results for the edge capacity polytope
2002,
Network loading problems occur in the design of telecommunication networks, in many...
Multicriteria decision making under uncertainty
Multicriteria decision making under uncertainty
2002,
Formalization for problems of multicriteria decision making under uncertainty is...
On splittable and unsplittable flow capacitated network design arc-set polyhedra
On splittable and unsplittable flow capacitated network design arc-set polyhedra
2002,
We study the polyhedra of splittable and unsplittable single arc–set relaxations...
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
2002,
We analyze the convergence of a sequential quadratic programming (SQP) method for...
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
2002,
This is the first of a series of two papers dedicated to efficient separation...
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
2002,
This paper is the second in a series of two papers dedicated to the separation problem...
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
2001,
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
Antiweb-wheel inequalities and their separation problems over the stable set polytopes
Antiweb-wheel inequalities and their separation problems over the stable set polytopes
2002,
A stable set in a graph G is a set of pairwise nonadjacent vertices. The problem of...
Valid inequalities for problems with additive variable upper bounds
Valid inequalities for problems with additive variable upper bounds
2001,
We study the facial structure of a polyhedron associated with the single node...
Fast and simple approximation schemes for generalized flow
Fast and simple approximation schemes for generalized flow
2002,
We present fast and simple fully polynomial-time approximation schemes (FPTAS) for...
A polynomial dual simplex algorithm for the generalized circulation problem
A polynomial dual simplex algorithm for the generalized circulation problem
2002,
This paper presents a polynomial-time dual simplex algorithm for the generalized...
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
2002,
We analyze the asymptotic behavior of the Flow Deviation Method, first presented in...
Approximating the single source unsplittable min-cost flow problem
Approximating the single source unsplittable min-cost flow problem
2002,
In the single source unsplittable min-cost flow problem, commodities must be routed...
A faster capacity scaling algorithm for minimum cost submodular flow
A faster capacity scaling algorithm for minimum cost submodular flow
2002,
We describe an O( n 4 h min{log U , n 2 log n }) capacity scaling algorithm for the...
Self-concordant barriers for hyperbolic means
Self-concordant barriers for hyperbolic means
2001,
The geometric mean and the function (det(·)) l/ m (on the m -by- m positive...
Discretization in semi-infinite programming: The rate of convergence
Discretization in semi-infinite programming: The rate of convergence
2001,
The discretization approach for solving semi-infinite optimization problems is...
Q-superlinear convergence of the iterates in primal–dual interior-point methods
Q-superlinear convergence of the iterates in primal–dual interior-point methods
2001,
Sufficient conditions are given for the Q-superlinear convergence of the iterates...
Dual bounding procedures lead to convergent branch-and-bound algorithms
Dual bounding procedures lead to convergent branch-and-bound algorithms
2001,
Branch-and-Bound methods with dual bounding procedures have recently been used to...
Perfect duality in semi-infinite and semidefinite programming
Perfect duality in semi-infinite and semidefinite programming
2001,
This paper develops new relationships between the recently constructed semidefinite...
Benchmarking optimization software with performance profiles
Benchmarking optimization software with performance profiles
2002,
We propose performance profiles – distribution functions for a performance...
Wedge trust region methods for derivative free optimization
Wedge trust region methods for derivative free optimization
2002,
A new method for derivative-free optimization is presented. It is designed for solving...
Papers per page: