Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Ivan Ginchev
@article{DBLP:journals/jgo/GinchevG13, author = {Ivan Ginchev and Denitza Gintcheva}, title = {Characterization and recognition of d.c. functions}, journal = {J. Glob. Optim.}, volume = {57}, number = {3}, pages = {633--647}, year = {2013}, url = {https://doi.org/10.1007/s10898-012-9964-6}, doi = {10.1007/S10898-012-9964-6}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/GinchevG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/oms/GinchevGR10, author = {Ivan Ginchev and Angelo Guerraggio and Matteo Rocca}, title = {Second-order Dini set-valued directional derivative in \emph{C} \({}^{\mbox{1, 1}}\) vector optimization}, journal = {Optim. Methods Softw.}, volume = {25}, number = {1}, pages = {75--87}, year = {2010}, url = {https://doi.org/10.1080/10556780903139446}, doi = {10.1080/10556780903139446}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/oms/GinchevGR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Ginchev09, author = {Ivan Ginchev}, title = {Vector optimization problems with quasiconvex constraints}, journal = {J. Glob. Optim.}, volume = {44}, number = {1}, pages = {111--130}, year = {2009}, url = {https://doi.org/10.1007/s10898-008-9314-x}, doi = {10.1007/S10898-008-9314-X}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Ginchev09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/CrespiGR06, author = {Giovanni Paolo Crespi and Ivan Ginchev and Matteo Rocca}, title = {First-order optimality conditions in set-valued optimization}, journal = {Math. Methods Oper. Res.}, volume = {63}, number = {1}, pages = {87--106}, year = {2006}, url = {https://doi.org/10.1007/s00186-005-0023-7}, doi = {10.1007/S00186-005-0023-7}, timestamp = {Sat, 20 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mmor/CrespiGR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/CrespiGR05, author = {Giovanni Paolo Crespi and Ivan Ginchev and Matteo Rocca}, title = {Existence of Solutions and Star-shapedness in Minty Variational Inequalities}, journal = {J. Glob. Optim.}, volume = {32}, number = {4}, pages = {485--494}, year = {2005}, url = {https://doi.org/10.1007/s10898-003-2685-0}, doi = {10.1007/S10898-003-2685-0}, timestamp = {Sat, 20 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgo/CrespiGR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GinchevGR05, author = {Ivan Ginchev and Angelo Guerraggio and Matteo Rocca}, title = {Second-order conditions in \emph{C}\({}^{\mbox{1, 1}}\) constrained vector optimization}, journal = {Math. Program.}, volume = {104}, number = {2-3}, pages = {389--405}, year = {2005}, url = {https://doi.org/10.1007/s10107-005-0621-4}, doi = {10.1007/S10107-005-0621-4}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GinchevGR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/CrespiGR05, author = {Giovanni Paolo Crespi and Ivan Ginchev and Matteo Rocca}, title = {A note on Minty type vector variational inequalities}, journal = {{RAIRO} Oper. Res.}, volume = {39}, number = {4}, pages = {253--273}, year = {2005}, url = {https://doi.org/10.1051/ro:2006005}, doi = {10.1051/RO:2006005}, timestamp = {Sat, 20 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rairo/CrespiGR05.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.