![](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
Sergio Cavero
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Sergio Cavero
, Manuel Laguna
, Eduardo G. Pardo
:
Solving a short sea inventory routing problem in the oil industry. Comput. Ind. Eng. 189: 109978 (2024) - [j6]Raúl Martín-Santamaría
, Sergio Cavero
, Alberto Herrán
, Abraham Duarte, J. Manuel Colmenar:
A Practical Methodology for Reproducible Experimentation: An Application to the Double-Row Facility Layout Problem. Evol. Comput. 32(1): 69-104 (2024) - [j5]Sergio Cavero
, Eduardo G. Pardo
, Fred W. Glover
, Rafael Martí
:
Strategic oscillation tabu search for improved hierarchical graph drawing. Expert Syst. Appl. 243: 122668 (2024) - [c5]Marcos Robles
, Sergio Cavero
, Eduardo G. Pardo
:
A Variable Neighborhood Search Approach for the S-labeling Problem. MIC (1) 2024: 371-376 - [c4]Sergio Cavero
, J. Manuel Colmenar
, Eduardo G. Pardo
:
A Variable Formulation Search Approach for Three Graph Layout Problems. MIC (1) 2024: 390-396 - 2023
- [j4]Sergio Cavero
, Eduardo G. Pardo
, Abraham Duarte
:
Efficient iterated greedy for the two-dimensional bandwidth minimization problem. Eur. J. Oper. Res. 306(3): 1126-1139 (2023) - [c3]Sergio Cavero
, Liliana Patricia Santacruz-Valencia
:
Using Microworlds to Teach Basic Programming Concepts to Future Early Childhood Education Teachers. SIIE 2023: 1-6 - 2022
- [j3]Sergio Cavero
, Eduardo G. Pardo
, Abraham Duarte
:
A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl. 81(2): 657-687 (2022) - [j2]Sergio Cavero
, Eduardo G. Pardo
, Abraham Duarte, Eduardo Rodriguez-Tello:
A variable neighborhood search approach for cyclic bandwidth sum problem. Knowl. Based Syst. 246: 108680 (2022) - [c2]Marcos Robles
, Sergio Cavero
, Eduardo G. Pardo
:
BVNS for the Minimum Sitting Arrangement Problem in a Cycle. ICVNS 2022: 82-96 - 2021
- [j1]Sergio Cavero
, Eduardo G. Pardo
, Manuel Laguna, Abraham Duarte
:
Multistart search for the Cyclic Cutwidth Minimization Problem. Comput. Oper. Res. 126: 105116 (2021) - [c1]Sergio Cavero
, Eduardo G. Pardo
, Abraham Duarte:
Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem. CAEPIA 2021: 139-149
Coauthor Index
![](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.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint