default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 74
Volume 74, 1996
- John N. Hooker:
Resolution and the integrality of satisfiability problems. 1-10 - Sanjay Mehrotra:
Asymptotic convergence in a generalized predictor-corrector method. 11-28 - Markku Verkama, Harri Ehtamo, Raimo P. Hämäläinen
:
Distributed computation of Pareto solutions in n-player games. 29-45 - Krzysztof C. Kiwiel:
Complexity of some cutting plane methods that use analytic centers. 47-54 - G. S. R. Murthy, T. Parthasarathy, Marco Sabatini:
Lipschitzian Q-matrices are P-matrices. 55-58 - Zsolt Páles, Vera Zeidan:
Generalized Hessian for C1, 1 functions in infinite dimensional normed spaces. 59-78 - Stephen A. Vavasis, Yinyu Ye:
A primal-dual interior point method whose running time depends only on the constraint matrix. 79-120 - Daniel Bienstock:
Computational study of a family of mixed-integer quadratic programming problems. 121-140 - Patrice Marcotte, Daoli Zhu:
Exact and inexact penalty methods for the generalized bilevel programming problem. 141-157 - Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang:
An interior point potential reduction method for constrained equations. 159-195 - S. R. Mohan, S. K. Neogy, R. Sridhar:
The generalized linear complementarity problem revisited. 197-218 - Alberto Caprara, Matteo Fischetti:
{0, 1/2}-Chvátal-Gomory cuts. 221-235 - Roland W. Freund, Florian Jarre, Siegfried Schaible:
On self-concordant barrier functions for conic hulls and fractional programming. 237-246 - Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey:
Formulations and valid inequalities for the node capacitated graph partitioning problem. 247-266 - M. Seetharama Gowda, Roman Sznajder:
On the Lipschitzian properties of polyhedral multifunctions. 267-278 - Andreas Fischer, Christian Kanzow:
On finite termination of an iterative method for linear complementarity problems. 279-292 - Kazutoshi Ando, Satoru Fujishige:
On structures of bisubmodular polyhedra. 293-317 - Tamás Rapcsák, T. T. Thang:
A class of polynomial variable metric algorithms for linear optimization. 319-331 - Adam B. Levy:
Implicit multifunction theorems for the sensitivity analysis of variational conditions. 333-350
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 2026-06-20 00:10 CEST 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:
