Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jgo/jgo24.bht:"
@article{DBLP:journals/jgo/Andramonov02, author = {Mikhail Andramonov}, title = {Solving Problems with Min-Type Functions by Disjunctive Programming}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {115--132}, year = {2002}, url = {https://doi.org/10.1023/A:1020204022612}, doi = {10.1023/A:1020204022612}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Andramonov02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Antipin02, author = {Anatoly S. Antipin}, title = {Gradient Approach of Computing Fixed Points of Equilibrium Problems}, journal = {J. Glob. Optim.}, volume = {24}, number = {3}, pages = {285--309}, year = {2002}, url = {https://doi.org/10.1023/A:1020321209606}, doi = {10.1023/A:1020321209606}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Antipin02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/AzH02, author = {Dominique Az and Jean{-}Baptiste Hiriart{-}Urruty}, title = {Optimal Hoffman-Type Estimates in Eigenvalue and Semidefinite Inequality Constraints}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {133--147}, year = {2002}, url = {https://doi.org/10.1023/A:1020204916793}, doi = {10.1023/A:1020204916793}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/AzH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/BattenB02, author = {Lynn Margaret Batten and Gleb Beliakov}, title = {Fast Algorithm for the Cutting Angle Method of Global Optimization}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {149--161}, year = {2002}, url = {https://doi.org/10.1023/A:1020256900863}, doi = {10.1023/A:1020256900863}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/BattenB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/BomzeK02, author = {Immanuel M. Bomze and Etienne de Klerk}, title = {Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {163--185}, year = {2002}, url = {https://doi.org/10.1023/A:1020209017701}, doi = {10.1023/A:1020209017701}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/BomzeK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/FortinT02, author = {Dominique Fortin and Ider Tseveendorj}, title = {Piecewise-Convex Maximization Problems: Algorithm and Computational Experiments}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {61--77}, year = {2002}, url = {https://doi.org/10.1023/A:1016221931922}, doi = {10.1023/A:1016221931922}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/FortinT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Gasimov02, author = {Rafail N. Gasimov}, title = {Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {187--203}, year = {2002}, url = {https://doi.org/10.1023/A:1020261001771}, doi = {10.1023/A:1020261001771}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Gasimov02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/GroenwoldS02, author = {Albert A. Groenwold and Jan A. Snyman}, title = {Global Optimization using Dynamic Search Trajectories}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {51--60}, year = {2002}, url = {https://doi.org/10.1023/A:1016267007352}, doi = {10.1023/A:1016267007352}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgo/GroenwoldS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Heitzer02, author = {Michael Heitzer}, title = {Structural Optimization with FEM-based Shakedown Analyses}, journal = {J. Glob. Optim.}, volume = {24}, number = {3}, pages = {371--384}, year = {2002}, url = {https://doi.org/10.1023/A:1020398622545}, doi = {10.1023/A:1020398622545}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Heitzer02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/HwangWL02, author = {Frank K. Hwang and Y. M. Wang and J. S. Lee}, title = {Sortability of Multi-partitions}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {463--472}, year = {2002}, url = {https://doi.org/10.1023/A:1021216024210}, doi = {10.1023/A:1021216024210}, timestamp = {Fri, 01 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/HwangWL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/KetabiS02, author = {S. Ketabi and Franz J. M. Salzborn}, title = {A Concavity Result for Network Design Problems}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {79--88}, year = {2002}, url = {https://doi.org/10.1023/A:1016231031814}, doi = {10.1023/A:1016231031814}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/KetabiS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/KimCCJ02, author = {Joonmo Kim and Mihaela Cardei and Ionut Cardei and Xiaohua Jia}, title = {A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {437--448}, year = {2002}, url = {https://doi.org/10.1023/A:1021298822593}, doi = {10.1023/A:1021298822593}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/KimCCJ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/KojimaT02, author = {Masakazu Kojima and Levent Tun{\c{c}}el}, title = {Some Fundamental Properties of Successive Convex Relaxation Methods on {LCP} and Related Problems}, journal = {J. Glob. Optim.}, volume = {24}, number = {3}, pages = {333--348}, year = {2002}, url = {https://doi.org/10.1023/A:1020300717650}, doi = {10.1023/A:1020300717650}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/KojimaT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/LiuT02, author = {Y. Liu and Kok Lay Teo}, title = {An Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming Problems}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {205--217}, year = {2002}, url = {https://doi.org/10.1023/A:1020234019886}, doi = {10.1023/A:1020234019886}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/LiuT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/LucidiP02, author = {Stefano Lucidi and Veronica Piccialli}, title = {New Classes of Globally Convexized Filled Functions for Global Optimization}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {219--236}, year = {2002}, url = {https://doi.org/10.1023/A:1020243720794}, doi = {10.1023/A:1020243720794}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/LucidiP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/MaYXLW02, author = {Weimin Ma and Jane You and Yin{-}Feng Xu and James N. K. Liu and Kanliang Wang}, title = {On the On-line Number of Snacks Problem}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {449--462}, year = {2002}, url = {https://doi.org/10.1023/A:1021253103047}, doi = {10.1023/A:1021253103047}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/MaYXLW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Mangasarian02, author = {O. L. Mangasarian}, title = {Set Containment Characterization}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {473--480}, year = {2002}, url = {https://doi.org/10.1023/A:1021207718605}, doi = {10.1023/A:1021207718605}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Mangasarian02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/NatarayK02, author = {P. S. V. Nataray and Ketan Kotecha}, title = {An Algorithm for Global Optimization using the Taylor-Bernstein Form as Inclusion Function}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {417--436}, year = {2002}, url = {https://doi.org/10.1023/A:1021296315884}, doi = {10.1023/A:1021296315884}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/NatarayK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/PapamichailA02, author = {Ioannis Papamichail and Claire S. Adjiman}, title = {A Rigorous Global Optimization Algorithm for Problems with Ordinary Differential Equations}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {1--33}, year = {2002}, url = {https://doi.org/10.1023/A:1016259507911}, doi = {10.1023/A:1016259507911}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/PapamichailA02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Porembski02, author = {Marcus Porembski}, title = {Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {89--107}, year = {2002}, url = {https://doi.org/10.1023/A:1016207513965}, doi = {10.1023/A:1016207513965}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Porembski02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/QiY02, author = {Liquin Qi and Yu{-}Fei Yang}, title = {{NCP} Functions Applied to Lagrangian Globalization for the Nonlinear Complementarity Problem}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {261--283}, year = {2002}, url = {https://doi.org/10.1023/A:1020247804865}, doi = {10.1023/A:1020247804865}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/QiY02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Ratschan02, author = {Stefan Ratschan}, title = {Search Heuristics for Box Decomposition Methods}, journal = {J. Glob. Optim.}, volume = {24}, number = {1}, pages = {35--49}, year = {2002}, url = {https://doi.org/10.1023/A:1016246616462}, doi = {10.1023/A:1016246616462}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Ratschan02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Rubinov02, author = {Alexander M. Rubinov}, title = {Preface}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {109}, year = {2002}, url = {https://doi.org/10.1023/A:1020276231990}, doi = {10.1023/A:1020276231990}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Rubinov02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/StubbsM02, author = {Robert A. Stubbs and Sanjay Mehrotra}, title = {Generating Convex Polynomial Inequalities for Mixed 0-1 Programs}, journal = {J. Glob. Optim.}, volume = {24}, number = {3}, pages = {311--332}, year = {2002}, url = {https://doi.org/10.1023/A:1020351410169}, doi = {10.1023/A:1020351410169}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/StubbsM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/TakedaFFK02, author = {Akiko Takeda and Katsuki Fujisawa and Yusuke Fukaya and Masakazu Kojima}, title = {Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems}, journal = {J. Glob. Optim.}, volume = {24}, number = {2}, pages = {237--260}, year = {2002}, url = {https://doi.org/10.1023/A:1020299805773}, doi = {10.1023/A:1020299805773}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/TakedaFFK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/TawarmalaniAS02, author = {Mohit Tawarmalani and Shabbir Ahmed and Nikolaos V. Sahinidis}, title = {Global Optimization of 0-1 Hyperbolic Programs}, journal = {J. Glob. Optim.}, volume = {24}, number = {4}, pages = {385--416}, year = {2002}, url = {https://doi.org/10.1023/A:1021279918708}, doi = {10.1023/A:1021279918708}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/TawarmalaniAS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Voorhis02, author = {Tim Van Voorhis}, title = {A Global Optimization Algorithm using Lagrangian Underestimates and the Interval Newton Method}, journal = {J. Glob. Optim.}, volume = {24}, number = {3}, pages = {349--370}, year = {2002}, url = {https://doi.org/10.1023/A:1020383700229}, doi = {10.1023/A:1020383700229}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Voorhis02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.