![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 18 matches
- 2023
- Babak Aslani
, Shima Mohebbi
:
Ensemble framework for causality learning with heterogeneous Directed Acyclic Graphs through the lens of optimization. Comput. Oper. Res. 152: 106148 (2023) - Matan Atsmony, Baruch Mor
, Gur Mosheiov
:
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Comput. Oper. Res. 152: 106133 (2023) - Adil M. Bagirov, Najmeh Hoseini Monjezi
, Sona Taheri
:
A novel optimization approach towards improving separability of clusters. Comput. Oper. Res. 152: 106135 (2023) - Roberto Bargetto
, Thierry Garaix
, Xiaolan Xie:
A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints. Comput. Oper. Res. 152: 106136 (2023) - Rafael Blanquero
, Emilio Carrizosa, Cristina Molero-Río
, Dolores Romero Morales
:
On optimal regression trees to detect critical intervals for multivariate functional data. Comput. Oper. Res. 152: 106152 (2023) - Meysam Borajee, Reza Tavakkoli-Moghaddam, Seyed-Houman Madani-Saatchi:
A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: An accelerated Benders decomposition algorithm. Comput. Oper. Res. 152: 106130 (2023) - Raffaele Cerulli
, Francesca Guerriero
, Edoardo Scalzo
, Carmine Sorgente
:
Shortest paths with exclusive-disjunction arc pairs conflicts. Comput. Oper. Res. 152: 106158 (2023) - N. A. Dieleman
, Joost Berkhout
, Bernd Heidergott
:
A neural network approach to performance analysis of tandem lines: The value of analytical knowledge. Comput. Oper. Res. 152: 106124 (2023) - Mageed Ghaleb, Sharareh Taghipour:
Dynamic shop-floor scheduling using real-time information: A case study from the thermoplastic industry. Comput. Oper. Res. 152: 106134 (2023) - Carla Juvin, Laurent Houssin
, Pierre Lopez
:
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem. Comput. Oper. Res. 152: 106156 (2023) - François Lamothe
, Emmanuel Rachelson
, Alain Haït
, Cédric Baudoin, Jean-Baptiste Dupe:
Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances. Comput. Oper. Res. 152: 106154 (2023) - Zunhao Luo, Yunqiang Yin
, Dujuan Wang
, T. C. E. Cheng
, Chin-Chia Wu:
Wasserstein distributionally robust chance-constrained program with moment information. Comput. Oper. Res. 152: 106150 (2023) - Erfaneh Nikzad
, Mahdi Bashiri, Babak Abbasi:
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach. Comput. Oper. Res. 152: 106126 (2023) - Emilio Jose Alarcon Ortega, Karl F. Doerner
:
A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows. Comput. Oper. Res. 152: 106129 (2023) - Feier Qiu
, Na Geng
, Honggang Wang:
An improved memetic algorithm for integrated production scheduling and vehicle routing decisions. Comput. Oper. Res. 152: 106127 (2023) - David Sayah
:
Continuous-time formulations for multi-mode project scheduling. Comput. Oper. Res. 152: 106147 (2023) - Felix Tamke
, Udo Buscher
:
The vehicle routing problem with drones and drone speed selection. Comput. Oper. Res. 152: 106112 (2023) - Daniel Valero-Carreras
, Javier Alcaraz
, Mercedes Landete:
Comparing two SVM models through different metrics based on the confusion matrix. Comput. Oper. Res. 152: 106131 (2023)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-30 00:54 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