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/mp69.bht:"
download as .bib file
@article{DBLP:journals/mp/AtkinsonV95,
author = {David S. Atkinson and
Pravin M. Vaidya},
title = {A cutting plane algorithm for convex programming that uses analytic
centers},
journal = {Math. Program.},
volume = {69},
pages = {1--43},
year = {1995},
url = {https://doi.org/10.1007/BF01585551},
doi = {10.1007/BF01585551},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AtkinsonV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BahnMGV95,
author = {Olivier Bahn and
Olivier du Merle and
Jean{-}Louis Goffin and
Jean{-}Philippe Vial},
title = {A cutting plane method from analytic centers for stochastic programming},
journal = {Math. Program.},
volume = {69},
pages = {45--73},
year = {1995},
url = {https://doi.org/10.1007/BF01585552},
doi = {10.1007/BF01585552},
timestamp = {Thu, 17 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BahnMGV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Barvinok95,
author = {Alexander I. Barvinok},
title = {New algorithms for linear k-matroid intersection and matroid k-parity
problems},
journal = {Math. Program.},
volume = {69},
pages = {449--470},
year = {1995},
url = {https://doi.org/10.1007/BF01585571},
doi = {10.1007/BF01585571},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Barvinok95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BellareR95,
author = {Mihir Bellare and
Phillip Rogaway},
title = {The complexity of approximating a nonlinear program},
journal = {Math. Program.},
volume = {69},
pages = {429--441},
year = {1995},
url = {https://doi.org/10.1007/BF01585569},
doi = {10.1007/BF01585569},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BellareR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Cao95,
author = {Jia{-}Ming Cao},
title = {Necessary and sufficient condition for local minima of a class of
nonconvex quadratic programs},
journal = {Math. Program.},
volume = {69},
pages = {403--411},
year = {1995},
url = {https://doi.org/10.1007/BF01585567},
doi = {10.1007/BF01585567},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Cao95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenH95,
author = {Bintong Chen and
Patrick T. Harker},
title = {A continuation method for monotone variational inequalities},
journal = {Math. Program.},
volume = {69},
pages = {237--253},
year = {1995},
url = {https://doi.org/10.1007/BF01585559},
doi = {10.1007/BF01585559},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChenH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Ebiefung95,
author = {Aniekan Ebiefung},
title = {Nonlinear mappings associated with the generalized linear complementarity
problem},
journal = {Math. Program.},
volume = {69},
pages = {255--268},
year = {1995},
url = {https://doi.org/10.1007/BF01585560},
doi = {10.1007/BF01585560},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Ebiefung95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Goemans95,
author = {Michel X. Goemans},
title = {Worst-case comparison of valid inequalities for the {TSP}},
journal = {Math. Program.},
volume = {69},
pages = {335--349},
year = {1995},
url = {https://doi.org/10.1007/BF01585563},
doi = {10.1007/BF01585563},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Goemans95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HamersBT95,
author = {Herbert Hamers and
Peter Borm and
Stef Tijs},
title = {On games corresponding to sequencing situations with ready times},
journal = {Math. Program.},
volume = {69},
pages = {471--483},
year = {1995},
url = {https://doi.org/10.1007/BF01585572},
doi = {10.1007/BF01585572},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HamersBT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HertogJRT95,
author = {Dick den Hertog and
Florian Jarre and
Kees Roos and
Tam{\'{a}}s Terlaky},
title = {A sufficient condition for self-concordance, with application to some
classes of structured convex programming problems},
journal = {Math. Program.},
volume = {69},
pages = {75--88},
year = {1995},
url = {https://doi.org/10.1007/BF01585553},
doi = {10.1007/BF01585553},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HertogJRT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HochbaumH95,
author = {Dorit S. Hochbaum and
Sung{-}Pil Hong},
title = {About strongly polynomial time algorithms for quadratic optimization
over submodular constraints},
journal = {Math. Program.},
volume = {69},
pages = {269--309},
year = {1995},
url = {https://doi.org/10.1007/BF01585561},
doi = {10.1007/BF01585561},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HochbaumH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Kiwiel95,
author = {Krzysztof C. Kiwiel},
title = {Proximal level bundle methods for convex nondifferentiable optimization,
saddle-point problems and variational inequalities},
journal = {Math. Program.},
volume = {69},
pages = {89--109},
year = {1995},
url = {https://doi.org/10.1007/BF01585554},
doi = {10.1007/BF01585554},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Kiwiel95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LemarechalNN95,
author = {Claude Lemar{\'{e}}chal and
Arkadii Nemirovskii and
Yurii E. Nesterov},
title = {New variants of bundle methods},
journal = {Math. Program.},
volume = {69},
pages = {111--147},
year = {1995},
url = {https://doi.org/10.1007/BF01585555},
doi = {10.1007/BF01585555},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LemarechalNN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Miao95,
author = {Jianming Miao},
title = {A quadratically convergent O((k+1)root(n)L)-iteration algorithm for
the P(k)-matrix linear complementarity problem},
journal = {Math. Program.},
volume = {69},
pages = {355--368},
year = {1995},
url = {https://doi.org/10.1007/BF01585565},
doi = {10.1007/BF01585565},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Miao95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MonteiroW95,
author = {Renato D. C. Monteiro and
Stephen J. Wright},
title = {Superlinear primal-dual affine scaling algorithms for {LCP}},
journal = {Math. Program.},
volume = {69},
pages = {311--333},
year = {1995},
url = {https://doi.org/10.1007/BF01585562},
doi = {10.1007/BF01585562},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/MonteiroW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Nesterov95,
author = {Yurii E. Nesterov},
title = {Complexity estimates of some cutting plane methods based on the analytic
barrier},
journal = {Math. Program.},
volume = {69},
pages = {149--176},
year = {1995},
url = {https://doi.org/10.1007/BF01585556},
doi = {10.1007/BF01585556},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Nesterov95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/NesterovN95,
author = {Yurii E. Nesterov and
A. S. Nemirovskii},
title = {An interior-point method for generalized linear-fractional programming},
journal = {Math. Program.},
volume = {69},
pages = {177--204},
year = {1995},
url = {https://doi.org/10.1007/BF01585557},
doi = {10.1007/BF01585557},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/NesterovN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/TayurTN95,
author = {Sridhar R. Tayur and
Rekha R. Thomas and
N. R. Natraj},
title = {An algebraic geometry algorithm for scheduling in presence of setups
and correlated demands},
journal = {Math. Program.},
volume = {69},
pages = {369--401},
year = {1995},
url = {https://doi.org/10.1007/BF01585566},
doi = {10.1007/BF01585566},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/TayurTN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/VandenbergheB95,
author = {Lieven Vandenberghe and
Stephen P. Boyd},
title = {A primal-dual potential reduction method for problems involving matrix
inequalities},
journal = {Math. Program.},
volume = {69},
pages = {205--236},
year = {1995},
url = {https://doi.org/10.1007/BF01585558},
doi = {10.1007/BF01585558},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/VandenbergheB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Velde95,
author = {Steef L. van de Velde},
title = {Dual decomposition of a single-machine scheduling problem},
journal = {Math. Program.},
volume = {69},
pages = {413--428},
year = {1995},
url = {https://doi.org/10.1007/BF01585568},
doi = {10.1007/BF01585568},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Velde95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ZabinskyWSB95,
author = {Zelda B. Zabinsky and
Graham R. Wood and
Mike A. Steel and
William Baritompa},
title = {Pure adaptive search for finite global optimization},
journal = {Math. Program.},
volume = {69},
pages = {443--448},
year = {1995},
url = {https://doi.org/10.1007/BF01585570},
doi = {10.1007/BF01585570},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ZabinskyWSB95.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-06-29 04:54 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:
