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/mp102.bht:"
download as .bib file
@article{DBLP:journals/mp/AhmedG05,
author = {Shabbir Ahmed and
Yongpei Guan},
title = {The inverse optimal value problem},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {91--110},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0515-x},
doi = {10.1007/S10107-004-0515-X},
timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AhmedG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AndersenCL05,
author = {Kent Andersen and
G{\'{e}}rard Cornu{\'{e}}jols and
Yanjun Li},
title = {Split closure and intersection cuts},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {457--493},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0558-z},
doi = {10.1007/S10107-004-0558-Z},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AndersenCL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Anjos05,
author = {Miguel F. Anjos},
title = {An improved semidefinite programming relaxation for the satisfiability
problem},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {589--608},
year = {2005},
url = {https://doi.org/10.1007/s10107-003-0495-2},
doi = {10.1007/S10107-003-0495-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Anjos05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Ben-TalN05,
author = {Aharon Ben{-}Tal and
Arkadi Nemirovski},
title = {Non-euclidean restricted memory level method for large-scale convex
optimization},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {407--456},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0553-4},
doi = {10.1007/S10107-004-0553-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Ben-TalN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BorradaileH05,
author = {Glencora Borradaile and
Pascal Van Hentenryck},
title = {Safe and tight linear estimators for global optimization},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {495--517},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0533-8},
doi = {10.1007/S10107-004-0533-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BorradaileH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CalafioreC05,
author = {Giuseppe Carlo Calafiore and
Marco C. Campi},
title = {Uncertain convex programs: randomized solutions and confidence levels},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {25--46},
year = {2005},
url = {https://doi.org/10.1007/s10107-003-0499-y},
doi = {10.1007/S10107-003-0499-Y},
timestamp = {Tue, 07 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CalafioreC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChudakW05,
author = {Fabi{\'{a}}n A. Chudak and
David P. Williamson},
title = {Improved approximation algorithms for capacitated facility location
problems},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {207--222},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0524-9},
doi = {10.1007/S10107-004-0524-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ChudakW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DannaRP05,
author = {Emilie Danna and
Edward Rothberg and
Claude Le Pape},
title = {Exploring relaxation induced neighborhoods to improve {MIP} solutions},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {71--90},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0518-7},
doi = {10.1007/S10107-004-0518-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/DannaRP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EisenbrandL05,
author = {Friedrich Eisenbrand and
S{\"{o}}ren Laue},
title = {A linear algorithm for integer programming in the plane},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {249--259},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0520-0},
doi = {10.1007/S10107-004-0520-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/EisenbrandL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LabbeYG05,
author = {Martine Labb{\'{e}} and
Hande Yaman and
{\'{E}}ric Gourdin},
title = {A branch and cut algorithm for hub location problems with single assignment},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {371--405},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0531-x},
doi = {10.1007/S10107-004-0531-X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LabbeYG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Meurdesoif05,
author = {Philippe Meurdesoif},
title = {Strengthening the Lov{\'{a}}sz Theta(G) bound for graph coloring},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {577--588},
year = {2005},
url = {https://doi.org/10.1007/s101070100246},
doi = {10.1007/S101070100246},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Meurdesoif05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/NemirovskiT05,
author = {Arkadi Nemirovski and
Levent Tun{\c{c}}el},
title = {"Cone-free" primal-dual path-following and potential-reduction polynomial
time interior-point methods},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {261--294},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0545-4},
doi = {10.1007/S10107-004-0545-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/NemirovskiT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Nowak05,
author = {Ivo Nowak},
title = {Lagrangian decomposition of block-separable mixed-integer all-quadratic
programs},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {295--312},
year = {2005},
url = {https://doi.org/10.1007/s10107-003-0500-9},
doi = {10.1007/S10107-003-0500-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Nowak05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Potra05,
author = {Florian A. Potra},
title = {The Kantorovich Theorem and interior point methods},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {47--70},
year = {2005},
url = {https://doi.org/10.1007/s10107-003-0501-8},
doi = {10.1007/S10107-003-0501-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Potra05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PuertoT05,
author = {Justo Puerto and
Arie Tamir},
title = {Locating tree-shaped facilities using the ordered median objective},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {313--338},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0547-2},
doi = {10.1007/S10107-004-0547-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/PuertoT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/QiSL05,
author = {Liqun Qi and
Alexander Shapiro and
Chen Ling},
title = {Differentiability and semismoothness properties of integral functions
and their applications},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {223--248},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0523-x},
doi = {10.1007/S10107-004-0523-X},
timestamp = {Fri, 26 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/QiSL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/RamaswamyOC05,
author = {Ramkumar Ramaswamy and
James B. Orlin and
Nilopal Chakravarti},
title = {Sensitivity analysis for shortest path problems and maximum capacity
path problems in undirected graphs},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {355--369},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0517-8},
doi = {10.1007/S10107-004-0517-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/RamaswamyOC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SeidenW05,
author = {Steven S. Seiden and
Gerhard J. Woeginger},
title = {The two-dimensional cutting stock problem revisited},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {519--530},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0548-1},
doi = {10.1007/S10107-004-0548-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SeidenW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SimZ05,
author = {Chee{-}Khian Sim and
Gongyun Zhao},
title = {A note on treating a second order cone program as a special case of
a semidefinite program},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {609--613},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0546-3},
doi = {10.1007/S10107-004-0546-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/SimZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/StorkU05,
author = {Frederik Stork and
Marc Uetz},
title = {On the generation of circuits and minimal forbidden sets},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {185--203},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0512-0},
doi = {10.1007/S10107-004-0512-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/StorkU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/StorkU05a,
author = {Frederik Stork and
Marc Uetz},
title = {On the generation of circuits and minimal forbidden sets},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {205},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0532-9},
doi = {10.1007/S10107-004-0532-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/StorkU05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Tamura05,
author = {Akihisa Tamura},
title = {Coordinatewise domain scaling algorithm for M-convex function minimization},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {339--354},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0522-y},
doi = {10.1007/S10107-004-0522-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Tamura05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/VandenbusscheN05,
author = {Dieter Vandenbussche and
George L. Nemhauser},
title = {A polyhedral study of nonconvex quadratic programs with box constraints},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {531--557},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0549-0},
doi = {10.1007/S10107-004-0549-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/VandenbusscheN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/VandenbusscheN05a,
author = {Dieter Vandenbussche and
George L. Nemhauser},
title = {A branch-and-cut algorithm for nonconvex quadratic programs with box
constraints},
journal = {Math. Program.},
volume = {102},
number = {3},
pages = {559--575},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0550-7},
doi = {10.1007/S10107-004-0550-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/VandenbusscheN05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/YamashitaYT05,
author = {Hiroshi Yamashita and
Hiroshi Yabe and
Takahito Tanabe},
title = {A globally and superlinearly convergent primal-dual interior point
trust region method for large scale constrained optimization},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {111--151},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0508-9},
doi = {10.1007/S10107-004-0508-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/YamashitaYT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Zhang05,
author = {Roxin Zhang},
title = {Weakly upper Lipschitz multifunctions and applications in parametric
optimization},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {153--166},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0509-8},
doi = {10.1007/S10107-004-0509-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Zhang05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Zhao05,
author = {Gongyun Zhao},
title = {A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage
Stochastic Convex Programming},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {1--24},
year = {2005},
url = {https://doi.org/10.1007/s10107-003-0471-x},
doi = {10.1007/S10107-003-0471-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Zhao05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ZhaoNI05,
author = {Liang Zhao and
Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {Greedy splitting algorithms for approximating multiway partition problems},
journal = {Math. Program.},
volume = {102},
number = {1},
pages = {167--183},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0510-2},
doi = {10.1007/S10107-004-0510-2},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ZhaoNI05.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-04 13:22 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:
