Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/coap/coap40.bht:"
@article{DBLP:journals/coap/AchtzigerS08, author = {Wolfgang Achtziger and Mathias Stolpe}, title = {Global optimization of truss topology with discrete bar areas - Part {I:} theory of relaxed problems}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {247--280}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9138-5}, doi = {10.1007/S10589-007-9138-5}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/AchtzigerS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/BensonS08, author = {Hande Y. Benson and David F. Shanno}, title = {Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {143--189}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9089-x}, doi = {10.1007/S10589-007-9089-X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/BensonS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/Chen08a, author = {Jinhai Chen}, title = {The convergence analysis of inexact Gauss-Newton methods for nonlinear problems}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {97--118}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9071-7}, doi = {10.1007/S10589-007-9071-7}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/Chen08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/ChenP08, author = {Jein{-}Shan Chen and Shaohua Pan}, title = {A family of {NCP} functions and a descent method for the nonlinear complementarity problem}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {389--404}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9086-0}, doi = {10.1007/S10589-007-9086-0}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/ChenP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/EpplerHM08, author = {Karsten Eppler and Helmut Harbrecht and Mario S. Mommer}, title = {A new fictitious domain method in shape optimization}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {281--298}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9076-2}, doi = {10.1007/S10589-007-9076-2}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/EpplerHM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/Ferreira-MendoncaLM08, author = {L. Ferreira{-}Mendon{\c{c}}a and V{\'{e}}ra Lucia Rocha Lopes and J. M. Mart{\'{\i}}nez}, title = {Quasi-Newton acceleration for equality-constrained minimization}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {373--388}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9090-4}, doi = {10.1007/S10589-007-9090-4}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/Ferreira-MendoncaLM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/FordNY08, author = {John A. Ford and Yasushi Narushima and Hiroshi Yabe}, title = {Multi-step nonlinear conjugate gradient methods for unconstrained minimization}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {191--216}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9087-z}, doi = {10.1007/S10589-007-9087-Z}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/FordNY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/Gonzalez-CastanoCBG08, author = {Francisco J. Gonz{\'{a}}lez{-}Casta{\~{n}}o and Enrique Costa{-}Montenegro and Juan C. Burguillo{-}Rial and Ubaldo M. Garc{\'{\i}}a{-}Palomares}, title = {Outdoor {WLAN} planning via non-monotone derivative-free optimization: algorithm adaptation and case study}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {405--419}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9091-3}, doi = {10.1007/S10589-007-9091-3}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/Gonzalez-CastanoCBG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/Gould08, author = {Nicholas I. M. Gould}, title = {How good are projection methods for convex feasibility problems?}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {1--12}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9073-5}, doi = {10.1007/S10589-007-9073-5}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/Gould08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/HahnKGSZ08, author = {Peter M. Hahn and Bum{-}Jin Kim and Monique Guignard and J. MacGregor Smith and Yi{-}Rong Zhu}, title = {An algorithm for the generalized quadratic assignment problem}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {351--372}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9093-1}, doi = {10.1007/S10589-007-9093-1}, timestamp = {Fri, 16 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/HahnKGSZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/HaouariLS08, author = {Mohamed Haouari and Safa Bhar Layeb and Hanif D. Sherali}, title = {The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {13--39}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9072-6}, doi = {10.1007/S10589-007-9072-6}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/HaouariLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/HeVWS08, author = {Jian He and Alex Verstak and Layne T. Watson and Masha Sosonkina}, title = {Design and implementation of a massively parallel version of {DIRECT}}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {217--245}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9092-2}, doi = {10.1007/S10589-007-9092-2}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/HeVWS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/KaoJ08, author = {Gio K. Kao and Sheldon H. Jacobson}, title = {Finding preferred subsets of Pareto optimal solutions}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {73--95}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9070-8}, doi = {10.1007/S10589-007-9070-8}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/KaoJ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/NtaimoS08, author = {Lewis Ntaimo and Suvrajeet Sen}, title = {A comparative study of decomposition algorithms for stochastic combinatorial optimization}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {299--319}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9085-1}, doi = {10.1007/S10589-007-9085-1}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/NtaimoS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/PunnakitikashemRB08, author = {Prattana Punnakitikashem and Jay M. Rosenberger and Deborah F. Buckley{-}Behan}, title = {Stochastic programming for nurse assignment}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {3}, pages = {321--349}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9084-2}, doi = {10.1007/S10589-007-9084-2}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/PunnakitikashemRB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/SilvaSV08, author = {R. Silva and Jo{\~{a}}o Soares and Lu{\'{\i}}s Nunes Vicente}, title = {Local analysis of the feasible primal-dual interior-point method}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {41--57}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9075-3}, doi = {10.1007/S10589-007-9075-3}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/SilvaSV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/SunHD08, author = {Wenyu Sun and Liusheng Hou and Chuangyin Dang}, title = {A modified trust region method with Beale's {PCG} technique for optimization}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {1}, pages = {59--72}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9078-0}, doi = {10.1007/S10589-007-9078-0}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/SunHD08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/Walkowiak08, author = {Krzysztof Walkowiak}, title = {Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks}, journal = {Comput. Optim. Appl.}, volume = {40}, number = {2}, pages = {119--141}, year = {2008}, url = {https://doi.org/10.1007/s10589-007-9077-1}, doi = {10.1007/S10589-007-9077-1}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/Walkowiak08.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.