default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 71
Volume 71, 1995
- Yoshiko Ikebe, Akihisa Tamura:
Ideal polytopes and face structures of some combinatorial optimization problems. 1-15 - Sehun Kim, Kun-Nyeong Chang, Jun-Yeon Lee:
A descent method with linear programming subproblems for nondifferentiable convex optimization. 17-28 - Monique Laurent, Svatopluk Poljak:
One-third-integrality in the max-cut problem. 29-50 - Chunhui Chen, Olvi L. Mangasarian:
Smoothing methods for convex inequalities and linear complementarity problems. 51-69 - Jack Brimberg:
The Fermat-Weber location problem revisited. 71-76 - Alfred Auslender, Mounir Haddou:
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. 77-100 - Emilio Carrizosa
, Frank Plastria:
On minquantile and maxcovering optimisation. 101-112 - El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey:
Optimizing constrained subtrees of trees. 113-126 - Charles E. Blair:
A closed-form representation of mixed-integer program value functions. 127-136 - Stefan E. Karisch, Franz Rendl:
Lower bounds for the quadratic assignment problem via triangle decompositions. 137-151 - Andrew V. Goldberg, Robert Kennedy:
An efficient cost scaling algorithm for the assignment problem. 153-177 - James V. Burke, Michael C. Ferris:
A Gauss-Newton method for convex composite optimization. 179-194 - R. Sridhar:
Superfluous matrices in linear complementarity. 195-206 - Ulf Brännlund:
A generalized subgradient method with relaxation step. 207-219 - Erling D. Andersen, Knud D. Andersen:
Presolving in linear programming. 221-245 - Michele Conforti, Gérard Cornuéjols:
Balanced 0, +-1-matrixces, bicoloring and total dual integrality. 249-258 - Sharon Filipowski:
On the complexity of solving feasible systems of linear inequalities specified with approximate data. 259-288 - Bart De Schutter, Bart De Moor:
The extended linear complementarity problem. 289-325 - Thomas L. Magnanti, Georgia Perakis:
A unifying geometric solution framework and complexity analysis for variational inequalities. 327-351 - F. Bruce Shepherd:
Applying Lehman's theorems to packing problems. 353-367 - Geoffrey Pritchard, Gül Gürkan, A. Yonca Özge:
A note on locally Lipschitzian functions. 369-370
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-29 01:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
