Journal: Mathematical Programming

Found 797 papers in total
Online algorithms: a survey
Online algorithms: a survey
2003,
During the last 15 years online algorithms have received considerable research...
Approximation schemes for NP-hard geometric optimization problems: a survey
Approximation schemes for NP-hard geometric optimization problems: a survey
2003,
Traveling Salesman, Steiner Tree, and many other famous genetic optimization problems...
The mathematics of eigenvalue optimization
The mathematics of eigenvalue optimization
2003,
Optimization problems involving the eigenvalues of symmetric and nonsymmetric matrices...
First- and second-order methods for semidefinite programming
First- and second-order methods for semidefinite programming
2003,
In this paper, we survey the most recent methods that have been developed for the...
Variational conditions with smooth constraints: structure and analysis
Variational conditions with smooth constraints: structure and analysis
2003,
This is an expository paper about the analysis of variational conditions over sets...
Recent advances in the solution of quadratic assignment problems
Recent advances in the solution of quadratic assignment problems
2003,
The quadratic assignment problem (QAP) is notoriously difficult for exact solution...
A practical general approximation criterion for methods of multipliers based on Bregman distances
A practical general approximation criterion for methods of multipliers based on Bregman distances
2003,
This paper demonstrates that for generalized methods of multipliers for convex...
Applications of convex optimization in signal processing and digital communication
Applications of convex optimization in signal processing and digital communication
2003,
In the last two decades, the mathematical programming community has witnessed some...
Logic-based Benders decomposition
Logic-based Benders decomposition
2003,
Benders decomposition uses a strategy of “learning from one's mistakes”....
Algebraic unimodular counting
Algebraic unimodular counting
2003,
We study algebraic algorithms for expressing the number of non-negative integer...
A primal all-integer algorithm based on irreducible solutions
A primal all-integer algorithm based on irreducible solutions
2003,
This paper introduces an exact primal augmentation algorithm for solving general...
On the positive sum property and the computation of Graver test sets
On the positive sum property and the computation of Graver test sets
2003,
In the first part of this paper we discuss the positive sum property, a property...
Gomory integer programs
Gomory integer programs
2003,
The set of all group relaxations of an integer program contains certain special...
Corner Polyhedra and their connection with cutting planes
Corner Polyhedra and their connection with cutting planes
2003,
We review the necessary background on Corner Polyhedra and use this to show how...
T-space and cutting planes
T-space and cutting planes
2003,
In this paper we show how knowledge about T-space translates directly into cutting...
Cyclic group and knapsack facets
Cyclic group and knapsack facets
2003,
Any integer program may be relaxed to a group problem. We define the master cyclic...
A polyhedral study of the cardinality constrained knapsack problem
A polyhedral study of the cardinality constrained knapsack problem
2003,
A cardinality constrained knapsack problem is a continuous knapsack problem in which...
Strong formulations for mixed integer programs: valid inequalities and extended formulations
Strong formulations for mixed integer programs: valid inequalities and extended formulations
2003,
We examine progress over the last fifteen years in finding strong valid inequalities...
Optimization in forestry
Optimization in forestry
2003,
Optimization models and methods have been used extensively in the forest industry. In...
Necessary conditions in optimal control: a new approach
Necessary conditions in optimal control: a new approach
2003,
We present necessary conditions of optimality for a general control problem formulated...
A linear integer programming bound for maximum-entropy sampling
A linear integer programming bound for maximum-entropy sampling
2003,
We introduce a new upper bound for the maximum-entropy sampling problem. Our bound is...
Second-order cone programming
Second-order cone programming
2003,
No abstract.
Non-monotone trust region methods for nonlinear quality constrained optimization without a penalty function
Non-monotone trust region methods for nonlinear quality constrained optimization without a penalty function
2003,
We propose and analyze a class of penalty-function-free nonmonotone trust-region...
Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases
Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases
2003,
The similarity and diversity sampling problems are two challenging optimization tasks...
Papers per page: