Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mp/mp78.bht:"
download as .bib file
@article{DBLP:journals/mp/ArmstrongJ97,
author = {Ronald D. Armstrong and
Zhiying Jin},
title = {A new strongly polynomial dual network simplex algorithm},
journal = {Math. Program.},
volume = {77},
pages = {131--148},
year = {1997},
url = {https://doi.org/10.1007/BF02614366},
doi = {10.1007/BF02614366},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ArmstrongJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BalasF97,
author = {Egon Balas and
Matteo Fischetti},
title = {On the monotonization of polyhedra},
journal = {Math. Program.},
volume = {77},
pages = {59--84},
year = {1997},
url = {https://doi.org/10.1007/BF02614506},
doi = {10.1007/BF02614506},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BalasF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Boland97,
author = {Natashia L. Boland},
title = {A dual-active-set algorithm for positive semi-definite quadratic programming},
journal = {Math. Program.},
volume = {77},
pages = {1--27},
year = {1997},
url = {https://doi.org/10.1007/BF02614503},
doi = {10.1007/BF02614503},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Boland97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BrunettaCR97,
author = {Lorenzo Brunetta and
Michele Conforti and
Giovanni Rinaldi},
title = {A branch-and-cut algorithm for the equicut problem},
journal = {Math. Program.},
volume = {77},
pages = {243--263},
year = {1997},
url = {https://doi.org/10.1007/BF02614373},
doi = {10.1007/BF02614373},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BrunettaCR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CambiniGS97,
author = {Riccardo Cambini and
Giorgio Gallo and
Maria Grazia Scutell{\`{a}}},
title = {Flows on hypergraphs},
journal = {Math. Program.},
volume = {77},
pages = {195--217},
year = {1997},
url = {https://doi.org/10.1007/BF02614371},
doi = {10.1007/BF02614371},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CambiniGS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Crouzeix97,
author = {Jean{-}Pierre Crouzeix},
title = {Pseudomonotone variational inequality problems: Existence of solutions},
journal = {Math. Program.},
volume = {77},
pages = {305--314},
year = {1997},
url = {https://doi.org/10.1007/BF02614358},
doi = {10.1007/BF02614358},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Crouzeix97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FlamA97,
author = {Sjur Didrik Fl{\aa}m and
Anatoly S. Antipin},
title = {Equilibrium programming using proximal-like algorithms},
journal = {Math. Program.},
volume = {77},
pages = {29--41},
year = {1997},
url = {https://doi.org/10.1007/BF02614504},
doi = {10.1007/BF02614504},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FlamA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GoldfarbC97,
author = {Donald Goldfarb and
Wei Chen},
title = {On strongly polynomial dual simplex algorithms for the maximum flow
problem},
journal = {Math. Program.},
volume = {77},
pages = {159--168},
year = {1997},
url = {https://doi.org/10.1007/BF02614368},
doi = {10.1007/BF02614368},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GoldfarbC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GrippoL97,
author = {Luigi Grippo and
Stefano Lucidi},
title = {A globally convergent version of the Polak-Ribi{\`{e}}re conjugate
gradient method},
journal = {Math. Program.},
volume = {77},
pages = {375--391},
year = {1997},
url = {https://doi.org/10.1007/BF02614362},
doi = {10.1007/BF02614362},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GrippoL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GrotschelMW97,
author = {Martin Gr{\"{o}}tschel and
Alexander Martin and
Robert Weismantel},
title = {The Steiner tree packing problem in {VLSI} design},
journal = {Math. Program.},
volume = {77},
pages = {265--281},
year = {1997},
url = {https://doi.org/10.1007/BF02614374},
doi = {10.1007/BF02614374},
timestamp = {Wed, 11 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/GrotschelMW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HenigB97,
author = {Mordechai I. Henig and
John T. Buchanan},
title = {Tradeoff directions in multiobjective optimization problems},
journal = {Math. Program.},
volume = {77},
pages = {357--374},
year = {1997},
url = {https://doi.org/10.1007/BF02614361},
doi = {10.1007/BF02614361},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HenigB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JansenRTY97,
author = {Benjamin Jansen and
Kees Roos and
Tam{\'{a}}s Terlaky and
Akiko Yoshise},
title = {Polynomiality of primal-dual affine scaling algorithms for nonlinear
complementarity problems},
journal = {Math. Program.},
volume = {77},
pages = {315--345},
year = {1997},
url = {https://doi.org/10.1007/BF02614359},
doi = {10.1007/BF02614359},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JansenRTY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Karzanov97,
author = {Alexander V. Karzanov},
title = {Multiflows and disjoint paths of minimum total cost},
journal = {Math. Program.},
volume = {77},
pages = {219--242},
year = {1997},
url = {https://doi.org/10.1007/BF02614372},
doi = {10.1007/BF02614372},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Karzanov97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/McCormick97,
author = {S. Thomas McCormick},
title = {How to compute least infeasible flows},
journal = {Math. Program.},
volume = {77},
pages = {179--194},
year = {1997},
url = {https://doi.org/10.1007/BF02614370},
doi = {10.1007/BF02614370},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/McCormick97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MonteiroZ97,
author = {Renato D. C. Monteiro and
Paulo R. Zanj{\'{a}}como},
title = {A note on the existence of the Alizadeh-Haeberly-Overton direction
for semidefinite programming},
journal = {Math. Program.},
volume = {77},
pages = {393--396},
year = {1997},
url = {https://doi.org/10.1007/BF02614363},
doi = {10.1007/BF02614363},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MonteiroZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin97,
author = {James B. Orlin},
title = {A polynomial time primal network simplex algorithm for minimum cost
flows},
journal = {Math. Program.},
volume = {77},
pages = {109--129},
year = {1997},
url = {https://doi.org/10.1007/BF02614365},
doi = {10.1007/BF02614365},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Orlin97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Peng97,
author = {Ji{-}Ming Peng},
title = {Equivalence of variational inequality problems to unconstrained minimization},
journal = {Math. Program.},
volume = {77},
pages = {347--355},
year = {1997},
url = {https://doi.org/10.1007/BF02614360},
doi = {10.1007/BF02614360},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Peng97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Radzik97,
author = {Tomasz Radzik},
title = {Fast deterministic approximation for the multicommodity flow problem},
journal = {Math. Program.},
volume = {77},
pages = {43--58},
year = {1997},
url = {https://doi.org/10.1007/BF02614505},
doi = {10.1007/BF02614505},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Radzik97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SokkalingamSA97,
author = {P. T. Sokkalingam and
Prabha Sharma and
Ravindra K. Ahuja},
title = {A new pivot selection rule for the network simplex algorithm},
journal = {Math. Program.},
volume = {77},
pages = {149--158},
year = {1997},
url = {https://doi.org/10.1007/BF02614367},
doi = {10.1007/BF02614367},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SokkalingamSA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Tarjan97,
author = {Robert Endre Tarjan},
title = {Dynamic trees as search trees via Euler tours, applied to the network
simplex algorithm},
journal = {Math. Program.},
volume = {77},
pages = {169--177},
year = {1997},
url = {https://doi.org/10.1007/BF02614369},
doi = {10.1007/BF02614369},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Tarjan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/YackelMC97,
author = {Jonathan Yackel and
Robert R. Meyer and
Ioannis T. Christou},
title = {Minimum-perimeter domain assignment},
journal = {Math. Program.},
volume = {77},
pages = {283--303},
year = {1997},
url = {https://doi.org/10.1007/BF02614375},
doi = {10.1007/BF02614375},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/YackelMC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Ye97,
author = {Yinyu Ye},
title = {Complexity analysis of the analytic center cutting plane method that
uses multiple cuts},
journal = {Math. Program.},
volume = {77},
pages = {85--104},
year = {1997},
url = {https://doi.org/10.1007/BF02614507},
doi = {10.1007/BF02614507},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Ye97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-01 14:16 CEST from data curated 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:
