default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 73
Volume 73, 1996
- Ulrich Faigle, Walter Kern, Martin Streng:
Note on the computational complexity of j-radii of polytopes in Realn. 1-5 - Sunil Chopra
, Jonathan H. Owen:
Extended formulations for the A-cut problem. 7-30 - Rudolf Müller:
On the partial order polytope of a digraph. 31-49 - Robert Mifflin:
A quasi-second-order proximal bundle algorithm. 51-72 - Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. 73-110 - Sanjiv Kapoor, Pravin M. Vaidya:
Speeding up Karmarkar's algorithm for multicommodity flows. 111-127 - Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest paths algorithms: Theory and experimental evaluation. 129-174 - Arkadi Nemirovski:
On polynomiality of the method of analyitc centers for fractional problems. 175-198 - Jong-Shi Pang, Jeffrey C. Trinkle:
Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction. 199-226 - Søren S. Nielsen, Stavros A. Zenios:
Solving multistage stochastic network programs on massively parallel computers. 227-250 - Livinus Ugochukwu Uko:
Generalized equations and the generalized Newton method. 251-268 - Stephen J. Wright, Yin Zhang:
A superquadratic infeasible-interior-point method for linear complementarity problems. 269-289 - Pravin M. Vaidya:
A new algorithm for minimizing convex functions over convex sets. 291-341
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-02-05 20:37 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:
