Journal: Mathematical Programming

Found 797 papers in total
Efficiently solvable special cases of hard combinatorial optimization problems
Efficiently solvable special cases of hard combinatorial optimization problems
1997,
We survey some recent advances in the field of polynomially solvable special cases of...
Two applications of the Divide&Conquer principle in the molecular sciences
Two applications of the Divide&Conquer principle in the molecular sciences
1997,
In this paper, two problems from the molecular sciences are addressed: the enumeration...
Semidefinite programming in combinatorial optimization
Semidefinite programming in combinatorial optimization
1997,
We discuss the use of semidefinite programming for combinatorial optimization...
Two generalizations of Dykstra's cyclic projections algorithm
Two generalizations of Dykstra's cyclic projections algorithm
1997,
Dykstra's cyclic projections algorithm allows one to compute best approximations to...
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
1997,
We analyze the complexity of the analytic center cutting plane or column generation...
How to deal with the unbounded in optimization: Theory and algorithms
How to deal with the unbounded in optimization: Theory and algorithms
1997,
The aim of this survey is to show how the unbounded arises in optimization problems...
A modified lift-and-project procedure
A modified lift-and-project procedure
1997,
In recent years the lift-and-project approach has been used successfully within a...
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
1997,
The...
Interior-point methods: An old and new approach to nonlinear programming
Interior-point methods: An old and new approach to nonlinear programming
1997,
In this paper we discuss the main concepts of structural optimization, a field of...
Cluster analysis and mathematical programming
Cluster analysis and mathematical programming
1997,
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters,...
Variation of cost functions in integer programming
Variation of cost functions in integer programming
1997,
We study the problem of minimizing c · x subject to A · x = b, x ⩾ 0...
Wheel inequalities for stable set polytopes
Wheel inequalities for stable set polytopes
1997,
We introduce new classes of valid inequalities, called wheel inequalities, for the...
Test sets for integer programs
Test sets for integer programs
1997,
In this paper I discuss various properties of the simplicial complex of maximal...
Minimum-perimeter domain assignment
Minimum-perimeter domain assignment
1997,
For certain classes of problems defined over two-dimensional domains with grid...
On the worst case complexity of potential reduction algorithms for linear programming
On the worst case complexity of potential reduction algorithms for linear programming
1997,
There are several classes of interior point algorithms that solve linear programming...
Linear programming, the simplex algorithm and simple polytopes
Linear programming, the simplex algorithm and simple polytopes
1997,
In the first part of the paper we survey some far-reaching applications of the basic...
Free material optimization via mathematical programming
Free material optimization via mathematical programming
1997,
This paper deals with a central question of structural optimization which is...
On the 0/1 knapsack polytope
On the 0/1 knapsack polytope
1997,
This paper deals with the 0/1 knapsack polytope. In particular, we introduce the...
A Gaussian upper bound for Gaussian multi-stage stochastic linear programs
A Gaussian upper bound for Gaussian multi-stage stochastic linear programs
1997,
This paper deals with two-stage and multi-stage stochastic programs in which the...
QPCOMP: A quadratic programming based solver for mixed complementarity problems
QPCOMP: A quadratic programming based solver for mixed complementarity problems
1997,
QPCOMP is an extemely robust algorithm for solving mixed nonlinear complementarity...
On the degree and separability of nonconvexity and applications to optimization problems
On the degree and separability of nonconvexity and applications to optimization problems
1997,
We study qualitative indications for d.c. representations of closed sets in and...
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
1997,
This paper presents two new trust-region methods for solving nonlinear optimization...
Semidefinite programming
Semidefinite programming
1997,
No abstract. An introduction to a grouping of papers in Mathematical Programming...
Complementarity and nondegeneracy in semidefinite programming
Complementarity and nondegeneracy in semidefinite programming
1997,
Primal and dual nondegeneracy conditions are defined for semidefinite programming....
Papers per page: