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 218 matches
- 2024
- Agostinho Agra, Cristina Requejo:
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem. EURO J. Comput. Optim. 12: 100081 (2024) - Immanuel M. Bomze:
The Marguerite Frank Award for the best EJCO paper 2023. EURO J. Comput. Optim. 12: 100087 (2024) - Lorenzo Bonasera, Stefano Gualandi:
Optimal shapelets tree for time series interpretable classification. EURO J. Comput. Optim. 12: 100091 (2024) - Francesco Carrabs, Manlio Gaudioso, Giovanna Miglionico:
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem. EURO J. Comput. Optim. 12: 100092 (2024) - Pasquale Cascarano, Giorgia Franchini, Erich Kobler, Federica Porta, Andrea Sebastiani:
A variable metric proximal stochastic gradient method: An application to classification problems. EURO J. Comput. Optim. 12: 100088 (2024) - Aldo Duarte, Truong X. Nghiem, Shuangqing Wei:
Communication-efficient ADMM using quantization-aware Gaussian process regression. EURO J. Comput. Optim. 12: 100098 (2024) - Casey Garner, Allen Holder:
Classifying with uncertain data envelopment analysis. EURO J. Comput. Optim. 12: 100090 (2024) - Markó Horváth:
New computational results for integrated production and outbound distribution scheduling problems for a product with a short lifespan. EURO J. Comput. Optim. 12: 100095 (2024) - Queenie Yingkun Huang, V. Jeyakumar, Guoyin Li:
Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. EURO J. Comput. Optim. 12: 100094 (2024) - Matteo Lapucci, Fabio Schoen:
Advances in nonlinear optimization and equilibrium problems - Special issue editorial. EURO J. Comput. Optim. 12: 100086 (2024) - Ricardo M. Lima, Gonzalo E. Constante-Flores, Antonio J. Conejo, Omar M. Knio:
An effective hybrid decomposition approach to solve the network-constrained stochastic unit commitment problem in large-scale power systems. EURO J. Comput. Optim. 12: 100085 (2024) - Ouissem Mesli-Kesraoui, Loic Ledreck, Emmanuel Grolleau, Soraya Kesraoui, Pascal Berruet, Yassine Ouhammou, Patrick Girard:
Resource constraint scheduling on two dedicated machines: Application to avionics. EURO J. Comput. Optim. 12: 100093 (2024) - Nahal Sakhavand, Jay M. Rosenberger, Victoria C. P. Chen, Harsha Gangammanavar:
Design of experiments for the stochastic unit commitment with economic dispatch models. EURO J. Comput. Optim. 12: 100089 (2024) - Giulia Di Teodoro, Marta Monaci, Laura Palagi:
Unboxing Tree ensembles for interpretability: A hierarchical visualization tool and a multivariate optimal re-built tree. EURO J. Comput. Optim. 12: 100084 (2024) - 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)
skipping 188 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 2025-01-10 09:33 CET 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