Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2021
- Andrew Allman, Qi Zhang:
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs. J. Glob. Optim. 81(4): 861-880 (2021) - Daniel Aloise, Gilles Caporossi, Sébastien Le Digabel:
Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD). J. Glob. Optim. 81(1): 1-2 (2021) - Duong Thi Viet An, Nguyen Dong Yen:
Optimality conditions based on the Fréchet second-order subdifferential. J. Glob. Optim. 81(2): 351-365 (2021) - Charles Audet, Pierre Hansen, Dragutin Svrtan:
Using symbolic calculations to determine largest small polygons. J. Glob. Optim. 81(1): 261-268 (2021) - Manish Bansal, Yingqiu Zhang:
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs. J. Glob. Optim. 81(2): 391-433 (2021) - Roberto Baviera, Giulia Bianchi:
Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach. J. Glob. Optim. 81(2): 469-491 (2021) - Carlo Alberto De Bernardi, Enrico Miglierina:
A variational approach to the alternating projections method. J. Glob. Optim. 81(2): 323-350 (2021) - Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrín:
Detecting and solving aircraft conflicts using bilevel programming. J. Glob. Optim. 81(2): 529-557 (2021) - Liang Chen, Weikun Chen, Mu-Ming Yang, Yu-Hong Dai:
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. J. Glob. Optim. 81(3): 659-689 (2021) - Marilène Cherkesly, Claudio Contardo:
The conditional p-dispersion problem. J. Glob. Optim. 81(1): 23-83 (2021) - Thai Doan Chuong, V. Jeyakumar, Guoyin Li, Daniel Woolnough:
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. J. Glob. Optim. 81(4): 1095-1117 (2021) - Yarui Duan, Song Wang, Yuying Zhou:
A power penalty approach to a mixed quasilinear elliptic complementarity problem. J. Glob. Optim. 81(4): 901-918 (2021) - Srinivas Eswar, Ramakrishnan Kannan, Richard W. Vuduc, Haesun Park:
ORCA: Outlier detection and Robust Clustering for Attributed graphs. J. Glob. Optim. 81(4): 967-989 (2021) - Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu:
Experimental analysis of local searches for sparse reflexive generalized inverses. J. Glob. Optim. 81(4): 1057-1093 (2021) - Jacek Gondzio, E. Alper Yildirim:
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. J. Glob. Optim. 81(2): 293-321 (2021) - Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg:
Optimal decision trees for categorical data via integer programming. J. Glob. Optim. 81(1): 233-260 (2021) - Alain Hertz, Tsvi Kuflik, Noa Tuval:
Resolving sets and integer programs for recommender systems. J. Glob. Optim. 81(1): 153-178 (2021) - Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A branch-cut-and-price algorithm for optimal decoding in digital communication systems. J. Glob. Optim. 81(3): 805-834 (2021) - Ken Kobayashi, Yuichi Takano, Kazuhide Nakata:
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization. J. Glob. Optim. 81(2): 493-528 (2021) - Felipe Lara, Alireza Kabgani:
On global subdifferentials with applications in nonsmooth optimization. J. Glob. Optim. 81(4): 881-900 (2021) - Jingqun Li, Thia Kirubarajan, Ratnasingham Tharmarasa, Daly Brown, Krishna R. Pattipati:
A dual approach to multi-dimensional assignment problems. J. Glob. Optim. 81(3): 691-716 (2021) - Defeng Liu, Andrea Lodi, Mathieu Tanneau:
Learning chordal extensions. J. Glob. Optim. 81(1): 3-22 (2021) - Cheng Lu, Zhibin Deng:
A branch-and-bound algorithm for solving max-k-cut problem. J. Glob. Optim. 81(2): 367-389 (2021) - Fengqiao Luo, Sanjay Mehrotra:
A geometric branch and bound method for robust maximization of convex functions. J. Glob. Optim. 81(4): 835-859 (2021) - Kaiwen Ma, Nikolaos V. Sahinidis, Sreekanth Rajagopalan, Satyajith Amaran, Scott J. Bury:
Decomposition in derivative-free optimization. J. Glob. Optim. 81(2): 269-292 (2021) - Mihály Csaba Markót:
Improved interval methods for solving circle packing problems in the unit square. J. Glob. Optim. 81(3): 773-803 (2021) - Zhiqing Meng, Min Jiang, Rui Shen, Leiyan Xu, Chuangyin Dang:
An objective penalty function method for biconvex programming. J. Glob. Optim. 81(3): 599-620 (2021) - Juliane Müller, Jangho Park, Reetik Sahu, Charuleka Varadharajan, Bhavna Arora, Boris Faybishenko, Deborah A. Agarwal:
Surrogate optimization of deep neural networks for groundwater predictions. J. Glob. Optim. 81(1): 203-231 (2021) - Minh Pham, Xiaodong Lin, Andrzej Ruszczynski, Yu Du:
An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems. J. Glob. Optim. 81(1): 179-202 (2021) - Bettina Ponleitner, Hermann Schichl:
Exclusion regions for parameter-dependent systems of equations. J. Glob. Optim. 81(3): 621-644 (2021)
skipping 10 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-04 23:38 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