Volume 71,
1995
- Yoshiko Ikebe, Akihisa Tamura:
Ideal polytopes and face structures of some combinatorial optimization problems.
1-15 BibTeX
- Sehun Kim, Kun-Nyeong Chang, Jun-Yeon Lee:
A descent method with linear programming subproblems for nondifferentiable convex optimization.
17-28 BibTeX
- Monique Laurent, Svatopluk Poljak:
One-third-integrality in the max-cut problem.
29-50 BibTeX
- Chunhui Chen, Olvi L. Mangasarian:
Smoothing methods for convex inequalities and linear complementarity problems.
51-69 BibTeX
- Jack Brimberg:
The Fermat-Weber location problem revisited.
71-76 BibTeX
- Alfred Auslender, Mounir Haddou:
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities.
77-100 BibTeX
- Emilio Carrizosa, Frank Plastria:
On minquantile and maxcovering optimisation.
101-112 BibTeX
- El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey:
Optimizing constrained subtrees of trees.
113-126 BibTeX
- Charles Blair:
A closed-form representation of mixed-integer program value functions.
127-136 BibTeX
- Stefan E. Karisch, Franz Rendl:
Lower bounds for the quadratic assignment problem via triangle decompositions.
137-151 BibTeX
- Andrew V. Goldberg, Robert Kennedy:
An efficient cost scaling algorithm for the assignment problem.
153-177 BibTeX
- James V. Burke, Michael C. Ferris:
A Gauss-Newton method for convex composite optimization.
179-194 BibTeX
- R. Sridhar:
Superfluous matrices in linear complementarity.
195-206 BibTeX
- Ulf Brännlund:
A generalized subgradient method with relaxation step.
207-219 BibTeX
- Erling D. Andersen, Knud D. Andersen:
Presolving in linear programming.
221-245 BibTeX
- Michele Conforti, Gérard Cornuéjols:
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
249-258 BibTeX
- Sharon Filipowski:
On the complexity of solving feasible systems of linear inequalities specified with approximate data.
259-288 BibTeX
- Bart De Schutter, Bart De Moor:
The extended linear complementarity problem.
289-325 BibTeX
- Thomas L. Magnanti, Georgia Perakis:
A unifying geometric solution framework and complexity analysis for variational inequalities.
327-351 BibTeX
- F. Bruce Shepherd:
Applying Lehman's theorems to packing problems.
353-367 BibTeX
- Geoffrey Pritchard, Gül Gürkan, A. Yonca Özge:
A note on locally Lipschitzian functions.
369-370 BibTeX
Copyright © Sun May 17 00:14:03 2009
by Michael Ley (ley@uni-trier.de)
