![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/mp/mp54.bht:"
@article{DBLP:journals/mp/AnstreicherB92, author = {Kurt M. Anstreicher and Robert A. Bosch}, title = {Long steps in an O(n\({}^{\mbox{3}}\)L) algorithm for linear programming}, journal = {Math. Program.}, volume = {54}, pages = {251--265}, year = {1992}, url = {https://doi.org/10.1007/BF01586053}, doi = {10.1007/BF01586053}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/AnstreicherB92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/AnstreicherLR92, author = {Kurt M. Anstreicher and Jon Lee and Thomas F. Rutherford}, title = {Crashing a maximum-weight complementary basis}, journal = {Math. Program.}, volume = {54}, pages = {281--294}, year = {1992}, url = {https://doi.org/10.1007/BF01586055}, doi = {10.1007/BF01586055}, timestamp = {Mon, 12 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/AnstreicherLR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BarnesHR92, author = {Earl R. Barnes and Alan J. Hoffman and Uriel G. Rothblum}, title = {Optimal partitions having disjoint convex and conic hulls}, journal = {Math. Program.}, volume = {54}, pages = {69--86}, year = {1992}, url = {https://doi.org/10.1007/BF01586042}, doi = {10.1007/BF01586042}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BarnesHR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BillionnetS92, author = {Alain Billionnet and Alain Sutter}, title = {Persistency in quadratic 0-1 optimization}, journal = {Math. Program.}, volume = {54}, pages = {115--119}, year = {1992}, url = {https://doi.org/10.1007/BF01586044}, doi = {10.1007/BF01586044}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BillionnetS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BlandJ92, author = {Robert G. Bland and David L. Jensen}, title = {On the computational behavior of a polynomial-time network flow algorithm}, journal = {Math. Program.}, volume = {54}, pages = {1--39}, year = {1992}, url = {https://doi.org/10.1007/BF01586039}, doi = {10.1007/BF01586039}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BlandJ92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/CaronHM92, author = {Richard J. Caron and Myron Hlynka and J. Fred McDonald}, title = {On the best case performance of hit and run methods for detecting necessary constraints}, journal = {Math. Program.}, volume = {54}, pages = {233--249}, year = {1992}, url = {https://doi.org/10.1007/BF01586052}, doi = {10.1007/BF01586052}, timestamp = {Sat, 13 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/CaronHM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KojimaMY92, author = {Masakazu Kojima and Nimrod Megiddo and Yinyu Ye}, title = {An interior point potential reduction algorithm for the linear complementarity problem}, journal = {Math. Program.}, volume = {54}, pages = {267--279}, year = {1992}, url = {https://doi.org/10.1007/BF01586054}, doi = {10.1007/BF01586054}, timestamp = {Sun, 18 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/KojimaMY92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LaiW92, author = {H. C. Lai and S. Y. Wu}, title = {Extremal points and optimal solutions for general capacity problems}, journal = {Math. Program.}, volume = {54}, pages = {87--113}, year = {1992}, url = {https://doi.org/10.1007/BF01586043}, doi = {10.1007/BF01586043}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/LaiW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Mladineo92, author = {Regina Hunter Mladineo}, title = {Convergence rates of a global optimization algorithm}, journal = {Math. Program.}, volume = {54}, pages = {223--232}, year = {1992}, url = {https://doi.org/10.1007/BF01586051}, doi = {10.1007/BF01586051}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Mladineo92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/OrlinA92, author = {James B. Orlin and Ravindra K. Ahuja}, title = {New scaling algorithms for the assignment and minimum mean cycle problems}, journal = {Math. Program.}, volume = {54}, pages = {41--56}, year = {1992}, url = {https://doi.org/10.1007/BF01586040}, doi = {10.1007/BF01586040}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/OrlinA92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/PolakHM92, author = {Elijah Polak and J. E. Higgins and David Q. Mayne}, title = {A barrier function method for minimax problems}, journal = {Math. Program.}, volume = {54}, pages = {155--176}, year = {1992}, url = {https://doi.org/10.1007/BF01586049}, doi = {10.1007/BF01586049}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/PolakHM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Polyak92, author = {Roman A. Polyak}, title = {Modified barrier functions (theory and methods)}, journal = {Math. Program.}, volume = {54}, pages = {177--222}, year = {1992}, url = {https://doi.org/10.1007/BF01586050}, doi = {10.1007/BF01586050}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Polyak92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/RoosV92, author = {Kees Roos and Jean{-}Philippe Vial}, title = {A polynomial method of approximate centers for linear programming}, journal = {Math. Program.}, volume = {54}, pages = {295--305}, year = {1992}, url = {https://doi.org/10.1007/BF01586056}, doi = {10.1007/BF01586056}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/RoosV92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Rothblum92, author = {Uriel G. Rothblum}, title = {Characterization of stable matchings as extreme points of a polytope}, journal = {Math. Program.}, volume = {54}, pages = {57--67}, year = {1992}, url = {https://doi.org/10.1007/BF01586041}, doi = {10.1007/BF01586041}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Rothblum92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/SchochetmanS92, author = {Irwin E. Schochetman and Robert L. Smith}, title = {Finite dimensional approximation in infinite dimensional mathematical programming}, journal = {Math. Program.}, volume = {54}, pages = {307--333}, year = {1992}, url = {https://doi.org/10.1007/BF01586057}, doi = {10.1007/BF01586057}, timestamp = {Wed, 22 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/SchochetmanS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/SousaW92, author = {Jorge P. Sousa and Laurence A. Wolsey}, title = {A time indexed formulation of non-preemptive single machine scheduling problems}, journal = {Math. Program.}, volume = {54}, pages = {353--367}, year = {1992}, url = {https://doi.org/10.1007/BF01586059}, doi = {10.1007/BF01586059}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/SousaW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Topkis92, author = {Donald M. Topkis}, title = {Paths on polymatroids}, journal = {Math. Program.}, volume = {54}, pages = {335--351}, year = {1992}, url = {https://doi.org/10.1007/BF01586058}, doi = {10.1007/BF01586058}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Topkis92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Vavasis92, author = {Stephen A. Vavasis}, title = {Local minima for indefinite quadratic knapsack problems}, journal = {Math. Program.}, volume = {54}, pages = {127--153}, year = {1992}, url = {https://doi.org/10.1007/BF01586048}, doi = {10.1007/BF01586048}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Vavasis92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.