Остановите войну!
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 204 matches
- 2023
- Sahand Asgharieh Ahari, Burak Kocuk:
A mixed-integer exponential cone programming formulation for feature subset selection in logistic regression. EURO J. Comput. Optim. 11: 100069 (2023) - Kabiru Ahmed, Mohammed Yusuf Waziri, Abubakar Sani Halilu, Salisu Murtala:
On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application. EURO J. Comput. Optim. 11: 100057 (2023) - Rafael Kendy Arakaki, Fábio Luiz Usberti:
A parameterized lower bounding method for the open capacitated arc routing problem. EURO J. Comput. Optim. 11: 100080 (2023) - Annabella Astorino, Matteo Avolio, Antonio Fuduli:
Maximum-margin polyhedral separation for binary Multiple Instance Learning. EURO J. Comput. Optim. 11: 100070 (2023) - Ashenafi Awraris, Berhanu Guta Wordofa, Semu Mitiku Kassa:
Branch-and-cut solution approach for multilevel mixed integer linear programming problems. EURO J. Comput. Optim. 11: 100076 (2023) - Immanuel M. Bomze:
The Marguerite Frank Award for the best EJCO paper 2022. EURO J. Comput. Optim. 11: 100065 (2023) - Coralia Cartis, Panayotis Mertikopoulos:
Optimization Challenges in Data Science - Special Issue Editorial. EURO J. Comput. Optim. 11: 100064 (2023) - Majid H. M. Chauhdry:
A framework using nested partitions algorithm for convergence analysis of population distribution-based methods. EURO J. Comput. Optim. 11: 100067 (2023) - Gabriella Colajanni, Patrizia Daniele, Daniele Sciacca:
A variational approach for supply chain networks with environmental interests. EURO J. Comput. Optim. 11: 100075 (2023) - Tiago Dias, Paula Amaral:
A classification method based on a cloud of spheres. EURO J. Comput. Optim. 11: 100077 (2023) - Tibor Illés, Petra Renáta Rigó, Roland Török:
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation. EURO J. Comput. Optim. 11: 100072 (2023) - Vanessa Lange, Hans Daduna:
The Weber problem in logistic and services networks under congestion. EURO J. Comput. Optim. 11: 100056 (2023) - Maximilian Löffler, Enrico Bartolini, Michael Schneider:
A conceptually simple algorithm for the capacitated location-routing problem. EURO J. Comput. Optim. 11: 100063 (2023) - Sven Mallach:
Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem. EURO J. Comput. Optim. 11: 100071 (2023) - Ahmadreza Marandi, Virginie Lurkin:
An exact algorithm for the static pricing problem under discrete mixed logit demand. EURO J. Comput. Optim. 11: 100073 (2023) - Gioni Mexi, Timo Berthold, Domenico Salvagnin:
Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO J. Comput. Optim. 11: 100066 (2023) - Roberto Montemanni, Mauro Dell'Amico:
Constraint programming models for the parallel drone scheduling vehicle routing problem. EURO J. Comput. Optim. 11: 100078 (2023) - Mauro Passacantando, Fabio Raciti, Anna Nagurney:
International migrant flows: Coalition formation among countries and social welfare. EURO J. Comput. Optim. 11: 100062 (2023) - Hemen Sanati, Ghasem Moslehi, Mohammad Reisi-Nafchi:
Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs. EURO J. Comput. Optim. 11: 100052 (2023) - Derek H. Smith, Roberto Montemanni:
The missing Moore graph as an optimization problem. EURO J. Comput. Optim. 11: 100060 (2023) - Sara Venturini, Andrea Cristofari, Francesco Rinaldi, Francesco Tudisco:
Laplacian-based semi-Supervised learning in multilayer hypergraphs by coordinate descent. EURO J. Comput. Optim. 11: 100079 (2023) - Goran Vojvodic, Luis J. Novoa, Ahmad I. Jarrah:
Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem. EURO J. Comput. Optim. 11: 100059 (2023) - Xavier Warin:
Reservoir optimization and machine learning methods. EURO J. Comput. Optim. 11: 100068 (2023) - Jake Weiner, Andreas T. Ernst, Xiaodong Li, Yuan Sun:
Ranking constraint relaxations for mixed integer programs using a machine learning approach. EURO J. Comput. Optim. 11: 100061 (2023) - Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier, Emiliano Traversi:
Branch and price for submodular bin packing. EURO J. Comput. Optim. 11: 100074 (2023) - Vassilios Yfantis, Simon Wenzel, Achim Wagner, Martin Ruskowski, Sebastian Engell:
Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function. EURO J. Comput. Optim. 11: 100058 (2023) - 2022
- Miguel F. Anjos, Tibor Illés, Tamás Terlaky:
Celebrating 20 years of EUROpt. EURO J. Comput. Optim. 10: 100036 (2022) - Matteo Avolio, Antonio Fuduli:
A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem. EURO J. Comput. Optim. 10: 100032 (2022) - John E. Beasley:
An optimisation model for minimising changes in frequency allocations. EURO J. Comput. Optim. 10: 100042 (2022) - Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques. EURO J. Comput. Optim. 10: 100043 (2022)
skipping 174 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-31 02: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