Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 77
Volume 77, 1997
- Natashia L. Boland:
A dual-active-set algorithm for positive semi-definite quadratic programming. 1-27 - Sjur Didrik Flåm, Anatoly S. Antipin
:
Equilibrium programming using proximal-like algorithms. 29-41 - Tomasz Radzik:
Fast deterministic approximation for the multicommodity flow problem. 43-58 - Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. 59-84 - Yinyu Ye:
Complexity analysis of the analytic center cutting plane method that uses multiple cuts. 85-104 - James B. Orlin:
A polynomial time primal network simplex algorithm for minimum cost flows. 109-129 - Ronald D. Armstrong, Zhiying Jin:
A new strongly polynomial dual network simplex algorithm. 131-148 - P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja:
A new pivot selection rule for the network simplex algorithm. 149-158 - Donald Goldfarb, Wei Chen:
On strongly polynomial dual simplex algorithms for the maximum flow problem. 159-168 - Robert Endre Tarjan:
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. 169-177 - S. Thomas McCormick:
How to compute least infeasible flows. 179-194 - Riccardo Cambini, Giorgio Gallo, Maria Grazia Scutellà:
Flows on hypergraphs. 195-217 - Alexander V. Karzanov:
Multiflows and disjoint paths of minimum total cost. 219-242 - Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi:
A branch-and-cut algorithm for the equicut problem. 243-263 - Martin Grötschel, Alexander Martin, Robert Weismantel:
The Steiner tree packing problem in VLSI design. 265-281 - Jonathan Yackel, Robert R. Meyer, Ioannis T. Christou:
Minimum-perimeter domain assignment. 283-303 - Jean-Pierre Crouzeix:
Pseudomonotone variational inequality problems: Existence of solutions. 305-314 - Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise:
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. 315-345 - Ji-Ming Peng:
Equivalence of variational inequality problems to unconstrained minimization. 347-355 - Mordechai I. Henig, John T. Buchanan:
Tradeoff directions in multiobjective optimization problems. 357-374 - Luigi Grippo, Stefano Lucidi:
A globally convergent version of the Polak-Ribière conjugate gradient method. 375-391 - Renato D. C. Monteiro, Paulo R. Zanjácomo:
A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. 393-396
a service of 
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 2024-04-17 21:31 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:
