Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 54
Volume 54, 1992
- Robert G. Bland, David L. Jensen:
On the computational behavior of a polynomial-time network flow algorithm. 1-39 - James B. Orlin
, Ravindra K. Ahuja:
New scaling algorithms for the assignment and minimum mean cycle problems. 41-56 - Uriel G. Rothblum:
Characterization of stable matchings as extreme points of a polytope. 57-67 - Earl R. Barnes, Alan J. Hoffman, Uriel G. Rothblum:
Optimal partitions having disjoint convex and conic hulls. 69-86 - H. C. Lai, S. Y. Wu:
Extremal points and optimal solutions for general capacity problems. 87-113 - Alain Billionnet, Alain Sutter:
Persistency in quadratic 0-1 optimization. 115-119 - Stephen A. Vavasis:
Local minima for indefinite quadratic knapsack problems. 127-153 - Elijah Polak, J. E. Higgins, David Q. Mayne:
A barrier function method for minimax problems. 155-176 - Roman A. Polyak:
Modified barrier functions (theory and methods). 177-222 - Regina Hunter Mladineo:
Convergence rates of a global optimization algorithm. 223-232 - Richard J. Caron, Myron Hlynka, J. Fred McDonald:
On the best case performance of hit and run methods for detecting necessary constraints. 233-249 - Kurt M. Anstreicher, Robert A. Bosch:
Long steps in an O(n3L) algorithm for linear programming. 251-265 - Masakazu Kojima, Nimrod Megiddo, Yinyu Ye:
An interior point potential reduction algorithm for the linear complementarity problem. 267-279 - Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford:
Crashing a maximum-weight complementary basis. 281-294 - Kees Roos, Jean-Philippe Vial:
A polynomial method of approximate centers for linear programming. 295-305 - Irwin E. Schochetman, Robert L. Smith:
Finite dimensional approximation in infinite dimensional mathematical programming. 307-333 - Donald M. Topkis:
Paths on polymatroids. 335-351 - Jorge P. Sousa, Laurence A. Wolsey:
A time indexed formulation of non-preemptive single machine scheduling problems. 353-367
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-19 19:20 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:
