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/mp86.bht:"
download as .bib file
@article{DBLP:journals/mp/BauschkeBL99,
author = {Heinz H. Bauschke and
Jonathan M. Borwein and
Wu Li},
title = {Strong conical hull intersection property, bounded linear regularity,
Jameson's property (G), and error bounds in convex optimization},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {135--160},
year = {1999},
url = {https://doi.org/10.1007/s101070050083},
doi = {10.1007/S101070050083},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BauschkeBL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BerkelaarJRT99,
author = {Arjan Berkelaar and
Benjamin Jansen and
Kees Roos and
Tam{\'{a}}s Terlaky},
title = {Basis- and partition identification for quadratic programming and
linear complementarity problems},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {261--282},
year = {1999},
url = {https://doi.org/10.1007/s101070050089},
doi = {10.1007/S101070050089},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BerkelaarJRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Bofill99,
author = {Walter G{\'{o}}mez Bofill},
title = {Properties of an interior embedding for solving nonlinear optimization
problems},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {649--659},
year = {1999},
url = {https://doi.org/10.1007/s101070050109},
doi = {10.1007/S101070050109},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Bofill99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoydC99,
author = {Sylvia C. Boyd and
Robert Carr},
title = {A new bound for the ratio between the 2-matching problem and its linear
programming relaxation},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {499--514},
year = {1999},
url = {https://doi.org/10.1007/s101079900102},
doi = {10.1007/S101079900102},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BoydC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CeriaS99,
author = {Sebasti{\'{a}}n Ceria and
Jo{\~{a}}o Soares},
title = {Convex programming for disjunctive convex optimization},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {595--614},
year = {1999},
url = {https://doi.org/10.1007/s101070050106},
doi = {10.1007/S101070050106},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CeriaS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenY99,
author = {Xin Chen and
Ya{-}Xiang Yuan},
title = {A note on quadratic forms},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {187--197},
year = {1999},
url = {https://doi.org/10.1007/s101070050085},
doi = {10.1007/S101070050085},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChenY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CordierMLW99,
author = {C{\'{e}}cile Cordier and
Hugues Marchand and
Richard Laundy and
Laurence A. Wolsey},
title = {\emph{bc} - \emph{opt} : a branch-and-cut code for mixed integer programs},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {335--353},
year = {1999},
url = {https://doi.org/10.1007/s101070050092},
doi = {10.1007/S101070050092},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CordierMLW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DaniilidisH99,
author = {Aris Daniilidis and
Nicolas Hadjisavvas},
title = {Coercivity conditions and variational inequalities},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {433--438},
year = {1999},
url = {https://doi.org/10.1007/s101070050097},
doi = {10.1007/S101070050097},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/DaniilidisH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DengP99,
author = {Xiaotie Deng and
Christos H. Papadimitriou},
title = {Decision-making by hierarchies of discordant agents},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {417--431},
year = {1999},
url = {https://doi.org/10.1007/s101070050096},
doi = {10.1007/S101070050096},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DengP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EcksteinF99,
author = {Jonathan Eckstein and
Michael C. Ferris},
title = {Smooth methods of multipliers for complementarity problems},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {65--90},
year = {1999},
url = {https://doi.org/10.1007/s101079900076},
doi = {10.1007/S101079900076},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/EcksteinF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FerrisKM99,
author = {Michael C. Ferris and
Christian Kanzow and
Todd S. Munson},
title = {Feasible descent algorithms for mixed complementarity problems},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {475--497},
year = {1999},
url = {https://doi.org/10.1007/s101070050101},
doi = {10.1007/S101070050101},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FerrisKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FreundV99,
author = {Robert M. Freund and
Jorge R. Vera},
title = {Some characterizations and properties of the "distance to ill-posedness"
and the condition measure of a conic linear system},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {225--260},
year = {1999},
url = {https://doi.org/10.1007/s10107990063a},
doi = {10.1007/S10107990063A},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FreundV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GranotHT99,
author = {Daniel Granot and
Herbert Hamers and
Stef Tijs},
title = {On some balanced, totally balanced and submodular delivery games},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {355--366},
year = {1999},
url = {https://doi.org/10.1007/s101070050093},
doi = {10.1007/S101070050093},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GranotHT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Gunluk99,
author = {Oktay G{\"{u}}nl{\"{u}}k},
title = {A branch-and-cut algorithm for capacitated network design problems},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {17--39},
year = {1999},
url = {https://doi.org/10.1007/s101070050077},
doi = {10.1007/S101070050077},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Gunluk99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/He99,
author = {Bingsheng He},
title = {Inexact implicit methods for monotone general variational inequalities},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {199--217},
year = {1999},
url = {https://doi.org/10.1007/s101070050086},
doi = {10.1007/S101070050086},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/He99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HeinkenschlossUU99,
author = {Matthias Heinkenschloss and
Michael Ulbrich and
Stefan Ulbrich},
title = {Superlinear and quadratic convergence of affine-scaling interior-point
Newton methods for problems with simple bounds without strict complementarity
assumption},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {615--635},
year = {1999},
url = {https://doi.org/10.1007/s101070050107},
doi = {10.1007/S101070050107},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HeinkenschlossUU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HottaY99,
author = {Keisuke Hotta and
Akiko Yoshise},
title = {Global convergence of a class of non-interior point algorithms using
Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {105--133},
year = {1999},
url = {https://doi.org/10.1007/s101070050082},
doi = {10.1007/S101070050082},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HottaY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LarssonPS99,
author = {Torbj{\"{o}}rn Larsson and
Michael Patriksson and
Ann{-}Brith Str{\"{o}}mberg},
title = {Ergodic, primal convergence in dual subgradient schemes for convex
programming},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {283--312},
year = {1999},
url = {https://doi.org/10.1007/s101070050090},
doi = {10.1007/S101070050090},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LarssonPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeenselHK99,
author = {Robert L. M. J. van de Leensel and
C. P. M. van Hoesel and
Joris van de Klundert},
title = {Lifting valid inequalities for the precedence constrained knapsack
problem},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {161--185},
year = {1999},
url = {https://doi.org/10.1007/s101070050084},
doi = {10.1007/S101070050084},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LeenselHK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Levy99a,
author = {Adam B. Levy},
title = {Errata in implicit multifunction theorems for the sensitivity analysis
of variational conditions},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {439--441},
year = {1999},
url = {https://doi.org/10.1007/s101070050098},
doi = {10.1007/S101070050098},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Levy99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lovasz99,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Hit-and-run mixes fast},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {443--461},
year = {1999},
url = {https://doi.org/10.1007/s101070050099},
doi = {10.1007/S101070050099},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Lovasz99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MohanNPS99,
author = {S. R. Mohan and
S. K. Neogy and
T. Parthasarathy and
S. Sinha},
title = {Vertical linear complementarity and discounted zero-sum stochastic
games with {ARAT} structure},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {637--648},
year = {1999},
url = {https://doi.org/10.1007/s101070050108},
doi = {10.1007/S101070050108},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MohanNPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/NemirovskiRT99,
author = {Arkadi Nemirovski and
Cornelis Roos and
Tam{\'{a}}s Terlaky},
title = {On maximization of quadratic form over intersection of ellipsoids
with common center},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {463--473},
year = {1999},
url = {https://doi.org/10.1007/s101070050100},
doi = {10.1007/S101070050100},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/NemirovskiRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PengF99,
author = {Ji{-}Ming Peng and
Masao Fukushima},
title = {A hybrid Newton method for solving the variational inequality problem
via the D-gap function},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {367--386},
year = {1999},
url = {https://doi.org/10.1007/s101070050094},
doi = {10.1007/S101070050094},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/PengF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PengL99,
author = {Ji{-}Ming Peng and
Zheng{-}Hua Lin},
title = {A non-interior continuation method for generalized linear complementarity
problems},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {533--563},
year = {1999},
url = {https://doi.org/10.1007/s101070050104},
doi = {10.1007/S101070050104},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/PengL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PritchardZ99,
author = {Geoffrey Pritchard and
Golbon Zakeri},
title = {Upper bounds for Gaussian stochastic programs},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {51--63},
year = {1999},
url = {https://doi.org/10.1007/s101070050079},
doi = {10.1007/S101070050079},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/PritchardZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Robinson99a,
author = {Stephen M. Robinson},
title = {Linear convergence of epsilon-subgradient descent methods for a class
of convex functions},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {41--50},
year = {1999},
url = {https://doi.org/10.1007/s101070050078},
doi = {10.1007/S101070050078},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Robinson99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Ruckmann99,
author = {Jan{-}J. R{\"{u}}ckmann},
title = {On existence and uniqueness of stationary points in semi-infinite
optimization},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {387--415},
year = {1999},
url = {https://doi.org/10.1007/s101070050095},
doi = {10.1007/S101070050095},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Ruckmann99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/StubbsM99,
author = {Robert A. Stubbs and
Sanjay Mehrotra},
title = {A branch-and-cut method for 0-1 mixed convex programming},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {515--532},
year = {1999},
url = {https://doi.org/10.1007/s101070050103},
doi = {10.1007/S101070050103},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/StubbsM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Tuncel99,
author = {Levent Tun{\c{c}}el},
title = {Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {219--223},
year = {1999},
url = {https://doi.org/10.1007/s101070050087},
doi = {10.1007/S101070050087},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Tuncel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Tutuncu99,
author = {Reha H. T{\"{u}}t{\"{u}}nc{\"{u}}},
title = {An infeasible-interior-point potential-reduction algorithm for linear
programming},
journal = {Math. Program.},
volume = {86},
number = {2},
pages = {313--334},
year = {1999},
url = {https://doi.org/10.1007/s101070050091},
doi = {10.1007/S101070050091},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Tutuncu99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Vanderbeck99,
author = {Fran{\c{c}}ois Vanderbeck},
title = {Computational study of a column generation algorithm for bin packing
and cutting stock problems},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {565--594},
year = {1999},
url = {https://doi.org/10.1007/s101070050105},
doi = {10.1007/S101070050105},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Vanderbeck99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/WallacherZ99,
author = {Claus Wallacher and
Uwe T. Zimmermann},
title = {A polynomial cycle canceling algorithm for submodular flows},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {1--15},
year = {1999},
url = {https://doi.org/10.1007/s101070050076},
doi = {10.1007/S101070050076},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/WallacherZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/XuB99,
author = {Song Xu and
James V. Burke},
title = {A polynomial time interior-point path-following algorithm for {LCP}
based on Chen-Harker-Kanzow smoothing techniques},
journal = {Math. Program.},
volume = {86},
number = {1},
pages = {91--103},
year = {1999},
url = {https://doi.org/10.1007/s101070050081},
doi = {10.1007/S101070050081},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/XuB99.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-16 21:55 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:
