![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 23 matches
- 2023
- Beste Akbas
, Ayse Selin Kocaman:
A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification. Comput. Oper. Res. 154: 106202 (2023) - Hassan T. Anis, Giorgio Costa
, Roy H. Kwon
:
Risk-allocation-based index tracking. Comput. Oper. Res. 154: 106219 (2023) - Ali Balma
, Mehdi Mrad, Talel Ladhari:
Tight lower bounds for the Traveling Salesman Problem with draft limits. Comput. Oper. Res. 154: 106196 (2023) - Nathan T. Boyd
, Steven A. Gabriel, George Rest, Tom Dumm:
Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: Application to water resource systems. Comput. Oper. Res. 154: 106194 (2023) - Thomas Breugem
, Thomas Schlechte
, Christof Schulz
, Ralf Borndörfer:
A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem. Comput. Oper. Res. 154: 106186 (2023) - Emilio Carrizosa, Kseniia Kurishchenko
, Alfredo Marín, Dolores Romero Morales
:
On clustering and interpreting with rules by means of mathematical optimization. Comput. Oper. Res. 154: 106180 (2023) - Jorge Orestes Cerdeira
, Maria João Martins
, Marcos Raydan
:
The max-out min-in problem: A tool for data analysis. Comput. Oper. Res. 154: 106218 (2023) - Yuxin Che, Zhenzhen Zhang
:
An Integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup. Comput. Oper. Res. 154: 106201 (2023) - Trivikram Dokka
, Marc Goerigk
:
Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Comput. Oper. Res. 154: 106213 (2023) - Xiaolei He, Weiguo Zhang
:
Two-stage international portfolio models with higher moment risk measures. Comput. Oper. Res. 154: 106200 (2023) - El Mehdi Ibnoulouafi, Mustapha Oudani
, Tarik Aouam
, Mounir Ghogho
:
The p-hub centre routing problem with emissions budget: Formulation and solution procedure. Comput. Oper. Res. 154: 106211 (2023) - Meng Li, Sebastian Wandelt, Kaiquan Cai
, Xiaoqian Sun:
Machine learning augmented approaches for hub location problems. Comput. Oper. Res. 154: 106188 (2023) - Jafar Sadeghi
, Mehmet A. Begen
, Fredrik Ødegaard
:
Refined bounds for the non-Archimedean ϵ in DEA. Comput. Oper. Res. 154: 106163 (2023) - Özge Safak
, Günes Erdogan
:
A Large Neighbourhood Search Algorithm for Solving Container Loading Problems. Comput. Oper. Res. 154: 106199 (2023) - Homayoun Shaabani
, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte:
A matheuristic for the multi-product maritime inventory routing problem. Comput. Oper. Res. 154: 106214 (2023) - Russell Stewart
, Andrea Raith
, Oliver Sinnen
:
Optimising makespan and energy consumption in task scheduling for parallel systems. Comput. Oper. Res. 154: 106212 (2023) - Rui Sun, Jieyu Wu, Chenghou Jin, Yiyuan Wang
, Wenbo Zhou
, Minghao Yin
:
An efficient local search algorithm for minimum positive influence dominating set problem. Comput. Oper. Res. 154: 106197 (2023) - Miguel E. Vázquez-Méndez
, Gerardo Casal
, Alberte Castro
, Duarte Santamarina
:
An automatic method for generating multiple alignment alternatives for a railway bypass. Comput. Oper. Res. 154: 106217 (2023) - Fuliang Wu, Ming Dong:
Eco-routing problem for the delivery of perishable products. Comput. Oper. Res. 154: 106198 (2023) - Yu Wu
, Bo Zeng:
Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach. Comput. Oper. Res. 154: 106176 (2023) - Weiping Xie
, Tianqi Liu, Xiang Li
, Chenyang Zheng:
Robust homecare service capacity planning. Comput. Oper. Res. 154: 106155 (2023) - Juan C. Yepes-Borrero
, Federico Perea
, Fulgencia Villa, Eva Vallada
:
Flowshop with additional resources during setups: Mathematical models and a GRASP algorithm. Comput. Oper. Res. 154: 106192 (2023) - Kai Zhang, Honggang Zhang, Qixiu Cheng
, Xinyuan Chen, Zewen Wang
, Zhiyuan Liu:
A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem. Comput. Oper. Res. 154: 106193 (2023)
loading more results
failed to load more results, please try again later
![](https://dblp.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-06-16 01:06 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