Journal: Mathematical Programming

Found 797 papers in total
A branch and cut approach to the cardinality constrained circuit problem
A branch and cut approach to the cardinality constrained circuit problem
2002,
The Cardinality Constrained Circuit Problem (CCCP) is the problem of finding a minimum...
On convergence of the Gauss–Newton method for convex composite optimization
On convergence of the Gauss–Newton method for convex composite optimization
2002,
The local quadratic convergence of the Gauss–Newton method for convex composite...
On the rank of mixed 0,1 polyhedra
On the rank of mixed 0,1 polyhedra
2002,
For a polytope in the [0,1] n cube, Eisenbrand and Schulz showed recently that the...
The primal–dual method for approximation algorithms
The primal–dual method for approximation algorithms
2002,
In this survey, we give an overview of a technique used to design and analyze...
Matching, matroids, and extensions
Matching, matroids, and extensions
2002,
Perhaps the two most fundamental well-solved models in combinatorial optimization are...
Objective-derivative-free methods for constrained optimization
Objective-derivative-free methods for constrained optimization
2002,
We propose feasible descent methods for constrained minimization that do not make...
A new inexact alternating directions method for monotone variational inequalities
A new inexact alternating directions method for monotone variational inequalities
2002,
The alternating directions method (ADM) is an effective method for solving a class of...
Convex composite non-Lipschitz programming
Convex composite non-Lipschitz programming
2002,
In this paper necessary and sufficient optimality conditions are established without...
Box-inequalities for quadratic assignment polytopes
Box-inequalities for quadratic assignment polytopes
2001,
Linear Programming based lower bounds have been considered both for the general as...
Minimizing the span of d-walks to compute optimum frequency assignments
Minimizing the span of d-walks to compute optimum frequency assignments
2002,
In this paper we deal with the Minimum Span Frequency Assignment Problem (MSFAP), that...
Solving large quadratic assignment problems on computational grids
Solving large quadratic assignment problems on computational grids
2002,
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization...
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
2002,
We present a randomized procedure for rounding fractional perfect matchings to...
Entropic proximal decomposition methods for convex programs and variational inequalities
Entropic proximal decomposition methods for convex programs and variational inequalities
2001,
We consider convex optimization and variational inequality problems with a given...
A characterization of ill-posed data instances for convex programming
A characterization of ill-posed data instances for convex programming
2002,
Given a data instance of a convex program, we provide a collection of conic linear...
A new condition number for linear programming
A new condition number for linear programming
2001,
In this paper we define a new condition number 𝒞 (A) for the following problem:...
The many facets of linear programming
The many facets of linear programming
2002,
We examine the history of linear programming from computational, geometric and...
History of mathematical programming in the USSR: Analyzing the phenomenon
History of mathematical programming in the USSR: Analyzing the phenomenon
2002,
I am not a historian; these are just reminiscences of a person involved in the...
On generalized trade-off directions in nonconvex multiobjective optimization
On generalized trade-off directions in nonconvex multiobjective optimization
2002,
Trade-off information related to Pareto optimal solutions is important in...
Nonlinear programming without a penalty function
Nonlinear programming without a penalty function
2002,
In this paper the solution of nonlinear programming problems by a Sequential Quadratic...
Duality and martingales: A stochastic programming perspective on contingent claims
Duality and martingales: A stochastic programming perspective on contingent claims
2002,
The hedging of contingent claims in the discrete time, discrete state case is analyzed...
A polynomial case of unconstrained zero–one quadratic optimization
A polynomial case of unconstrained zero–one quadratic optimization
2001,
Unconstrained zero–one quadratic maximization problems can be solved in...
On the history of the transportation and maximum flow problems
On the history of the transportation and maximum flow problems
2002,
We review two papers that are of historical interest for combinatorial optimization:...
From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
2002,
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job...
New classes of fast lower bounds for bin packing problems
New classes of fast lower bounds for bin packing problems
2001,
The bin packing problem is one of the classical NP-hard optimization problems. In this...
Papers per page: