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/mp83.bht:"
download as .bib file
@article{DBLP:journals/mp/BarahonaJ98,
author = {Francisco Barahona and
David L. Jensen},
title = {Plant location with minimum inventory},
journal = {Math. Program.},
volume = {83},
pages = {101--111},
year = {1998},
url = {https://doi.org/10.1007/BF02680552},
doi = {10.1007/BF02680552},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BarahonaJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CaroeT98,
author = {Claus C. Car{\o}e and
J{\o}rgen Tind},
title = {L-shaped decomposition of two-stage stochastic programs with integer
recourse},
journal = {Math. Program.},
volume = {83},
pages = {451--464},
year = {1998},
url = {https://doi.org/10.1007/BF02680570},
doi = {10.1007/BF02680570},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CaroeT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CarrizosaMP98,
author = {Emilio Carrizosa and
M. Mu{\~{n}}oz{-}M{\'{a}}rquez and
Justo Puerto},
title = {Location and shape of a rectangular facility in Real\({}^{\mbox{n}}\)
Convexity properties},
journal = {Math. Program.},
volume = {83},
pages = {277--290},
year = {1998},
url = {https://doi.org/10.1007/BF02680563},
doi = {10.1007/BF02680563},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CarrizosaMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChanSB98,
author = {Lap Mui Ann Chan and
David Simchi{-}Levi and
Julien Bramel},
title = {Worst-case analyses, linear programming and the bin-packing problem},
journal = {Math. Program.},
volume = {83},
pages = {213--227},
year = {1998},
url = {https://doi.org/10.1007/BF02680559},
doi = {10.1007/BF02680559},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChanSB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Deng98,
author = {Sien Deng},
title = {Perturbation analysis of a condition number for convex inequality
systems and global error bounds for analytic systems},
journal = {Math. Program.},
volume = {83},
pages = {263--276},
year = {1998},
url = {https://doi.org/10.1007/BF02680562},
doi = {10.1007/BF02680562},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Deng98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EavesS98,
author = {B. Curtis Eaves and
Karl H. Schmedders},
title = {A cellation of the Grassmann manifold},
journal = {Math. Program.},
volume = {83},
pages = {253--262},
year = {1998},
url = {https://doi.org/10.1007/BF02680561},
doi = {10.1007/BF02680561},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/EavesS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Eckstein98,
author = {Jonathan Eckstein},
title = {Approximate iterations in Bregman-function-based proximal algorithms},
journal = {Math. Program.},
volume = {83},
pages = {113--123},
year = {1998},
url = {https://doi.org/10.1007/BF02680553},
doi = {10.1007/BF02680553},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Eckstein98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleKFH98,
author = {Ulrich Faigle and
Walter Kern and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler},
title = {The nucleon of cooperative games and an algorithm for matching games},
journal = {Math. Program.},
volume = {83},
pages = {195--211},
year = {1998},
url = {https://doi.org/10.1007/BF02680558},
doi = {10.1007/BF02680558},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleKFH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Gondzio98,
author = {Jacek Gondzio},
title = {Warm start of the primal-dual method applied in the cutting-plane
scheme},
journal = {Math. Program.},
volume = {83},
pages = {125--143},
year = {1998},
url = {https://doi.org/10.1007/BF02680554},
doi = {10.1007/BF02680554},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Gondzio98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JongenRS98,
author = {Hubertus Th. Jongen and
Jan{-}J. R{\"{u}}ckmann and
Oliver Stein},
title = {Generalized semi-infinite optimization: {A} first order optimality
condition and examples},
journal = {Math. Program.},
volume = {83},
pages = {145--158},
year = {1998},
url = {https://doi.org/10.1007/BF02680555},
doi = {10.1007/BF02680555},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JongenRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KanzowF98,
author = {Christian Kanzow and
Masao Fukushima},
title = {Theoretical and numerical investigation of the D-gap function for
box constrained variational inequalities},
journal = {Math. Program.},
volume = {83},
pages = {55--87},
year = {1998},
url = {https://doi.org/10.1007/BF02680550},
doi = {10.1007/BF02680550},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KanzowF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Kearfott98,
author = {R. Baker Kearfott},
title = {On proving existence of feasible points in equality constrained optimization
problems},
journal = {Math. Program.},
volume = {83},
pages = {89--100},
year = {1998},
url = {https://doi.org/10.1007/BF02680551},
doi = {10.1007/BF02680551},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Kearfott98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KontogiorgisM98,
author = {Spyridon Kontogiorgis and
Robert R. Meyer},
title = {A variable-penalty alternating directions method for convex optimization},
journal = {Math. Program.},
volume = {83},
pages = {29--53},
year = {1998},
url = {https://doi.org/10.1007/BF02680549},
doi = {10.1007/BF02680549},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KontogiorgisM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LuksanV98,
author = {Ladislav Luksan and
Jan Vlcek},
title = {A bundle-Newton method for nonsmooth unconstrained minimization},
journal = {Math. Program.},
volume = {83},
pages = {373--391},
year = {1998},
url = {https://doi.org/10.1007/BF02680566},
doi = {10.1007/BF02680566},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LuksanV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Mangasarian98,
author = {Olvi L. Mangasarian},
title = {Error bounds for nondifferentiable convex inequalities under a strong
Slater constraint qualification},
journal = {Math. Program.},
volume = {83},
pages = {187--194},
year = {1998},
url = {https://doi.org/10.1007/BF02680557},
doi = {10.1007/BF02680557},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Mangasarian98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Muramatsu98,
author = {Masakazu Muramatsu},
title = {Affine scaling algorithm fails for semidefinite programming},
journal = {Math. Program.},
volume = {83},
pages = {393--406},
year = {1998},
url = {https://doi.org/10.1007/BF02680567},
doi = {10.1007/BF02680567},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Muramatsu98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Murota98a,
author = {Kazuo Murota},
title = {Discrete convex analysis},
journal = {Math. Program.},
volume = {83},
pages = {313--371},
year = {1998},
url = {https://doi.org/10.1007/BF02680565},
doi = {10.1007/BF02680565},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Murota98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/NorkinPR98,
author = {Vladimir I. Norkin and
Georg Ch. Pflug and
Andrzej Ruszczynski},
title = {A branch and bound method for stochastic global optimization},
journal = {Math. Program.},
volume = {83},
pages = {425--450},
year = {1998},
url = {https://doi.org/10.1007/BF02680569},
doi = {10.1007/BF02680569},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/NorkinPR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/NunezF98,
author = {Manuel N{\'{u}}{\~{n}}ez and
Robert M. Freund},
title = {Condition measures and properties of the central trajectory of a linear
program},
journal = {Math. Program.},
volume = {83},
pages = {1--28},
year = {1998},
url = {https://doi.org/10.1007/BF02680548},
doi = {10.1007/BF02680548},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/NunezF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ReijnierseP98,
author = {J. H. Reijnierse and
Jos A. M. Potters},
title = {On finding an envy-free Pareto-optimal division},
journal = {Math. Program.},
volume = {83},
pages = {291--311},
year = {1998},
url = {https://doi.org/10.1007/BF02680564},
doi = {10.1007/BF02680564},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ReijnierseP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SchultzSV98,
author = {R{\"{u}}diger Schultz and
Leen Stougie and
Maarten H. van der Vlerk},
title = {Solving stochastic programs with integer recourse by enumeration:
{A} framework using Gr{\"{o}}bner basis reductions},
journal = {Math. Program.},
volume = {83},
pages = {229--252},
year = {1998},
url = {https://doi.org/10.1007/BF02680560},
doi = {10.1007/BF02680560},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SchultzSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/StoerW98,
author = {Josef Stoer and
Martin Wechs},
title = {Infeasible-interior-point paths for sufficient linear complementarity
problems and their analyticity},
journal = {Math. Program.},
volume = {83},
pages = {407--423},
year = {1998},
url = {https://doi.org/10.1007/BF02680568},
doi = {10.1007/BF02680568},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/StoerW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Tseng98,
author = {Paul Tseng},
title = {Merit functions for semi-definite complementarity problems},
journal = {Math. Program.},
volume = {83},
pages = {159--185},
year = {1998},
url = {https://doi.org/10.1007/BF02680556},
doi = {10.1007/BF02680556},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Tseng98.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-30 05:03 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:
