Остановите войну!
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 61 matches
- 2024
- Vincent F. Yu, Pham Tuan Anh, Aldy Gunawan, Hsun Han:
A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks. Expert Syst. Appl. 237(Part C): 121631 (2024) - Huan Liu, Guohua Wu, Bin Ji, Ling Wang:
Multiobjective Variable Neighborhood Descent for Heterogeneous Multi-UAV Coordinated Scheduling. IEEE Trans. Aerosp. Electron. Syst. 60(2): 1808-1823 (2024) - 2023
- Biao Zhang, Chao Lu, Leilei Meng, Yu-yan Han, Hong-yan Sang, Xu-Chu Jiang:
Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm. Expert Syst. Appl. 217: 119548 (2023) - Hongfei Guo, Linsheng Zhang, Yaping Ren, Yun Li, Zhongwei Zhou, Jianzhao Wu:
Optimizing a stochastic disassembly line balancing problem with task failure via a hybrid variable neighborhood descent-artificial bee colony algorithm. Int. J. Prod. Res. 61(7): 2307-2321 (2023) - Gabriel F. Puerta, Leonardo H. Macedo, João P. Soares, Rubén Romero:
A Variable Neighborhood Descent Algorithm for the Service Restoration Problem of Radial Distribution Systems. DCAI (2) 2023: 277-287 - 2022
- Marcos R. C. O. Leite, Heder S. Bernardino, Luciana Brugiolo Gonçalves:
A variable neighborhood descent with ant colony optimization to solve a bilevel problem with station location and vehicle routing. Appl. Intell. 52(7): 7070-7090 (2022) - Xuping Wang, Wenping Fan, Hongxin Zhan, Zilai Sun:
Variable Neighborhood Descent for Multi-Compartment and Multi-Objective Vehicle Routing Problem in Refined Product Distribution. Asia Pac. J. Oper. Res. 39(2): 2150019:1-2150019:32 (2022) - Nikolaos A. Kyriakakis, Ioannis Sevastopoulos, Magdalene Marinaki, Yannis Marinakis:
A hybrid Tabu search - Variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications. Comput. Ind. Eng. 164: 107868 (2022) - Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
Variable Neighborhood Descent for Software Quality Optimization. MIC 2022: 531-536 - Jinting Zhu, Yunping Han, Xiwang Guo, Jiacun Wang, Shujin Qin, Liang Qi, Jian Zhao:
Union Variable Neighborhood Descent Algorithm for Multi-product Hybrid Disassembly Line Balancing Problem Considering Workstation Resource Configuration. SMC 2022: 860-865 - 2021
- Biao Zhang, Quan-Ke Pan, Leilei Meng, Xin-Li Zhang, Yaping Ren, Jun-Qing Li, Xu-Chu Jiang:
A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl. Soft Comput. 106: 107305 (2021) - Nikolaos A. Kyriakakis, Magdalene Marinaki, Yannis Marinakis:
A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 134: 105397 (2021) - Fang Liu, Lijun Yu, Jianfeng Zhu, Yueping Nie, Yu Sun:
Trip route simulation for pre-Qin settlements based on a gradient descent and variable-neighborhood ant colony optimization algorithm in the Linfen Basin, China. Earth Sci. Informatics 14(1): 415-428 (2021) - Orivalde S. Silva Júnior, José Eugênio Leal, Marc Reimann:
A multiple ant colony system with random variable neighborhood descent for the dynamic vehicle routing problem with time windows. Soft Comput. 25(4): 2935-2948 (2021) - Yulin Lan, Fagui Liu, Wing W. Y. Ng, Jun Zhang, Mengke Gui:
Decomposition Based Multi-Objective Variable Neighborhood Descent Algorithm for Logistics Dispatching. IEEE Trans. Emerg. Top. Comput. Intell. 5(5): 826-839 (2021) - Marcos R. C. O. Leite, Heder S. Bernardino, Luciana Brugiolo Gonçalves:
Solving a Bilevel Problem with Station Location and Vehicle Routing Using Variable Neighborhood Descent and Ant Colony Optimization. EPIA 2021: 211-223 - Thiago Muniz Stehling, Marcone Jamilson Freitas Souza, Sérgio Ricado D. E. de Souza:
Variable Neighborhood Descent Branching Applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet. ICVNS 2021: 14-27 - 2020
- Rodney Oliveira Marinho Diana, Sérgio Ricardo de Souza:
Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines. Comput. Oper. Res. 117: 104886 (2020) - Thiago Alves de Queiroz, Leandro Resende Mundim:
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. Int. Trans. Oper. Res. 27(3): 1478-1500 (2020) - 2019
- Dusan Dzamic, Daniel Aloise, Nenad Mladenovic:
Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann. Oper. Res. 272(1-2): 273-287 (2019) - Petar Afric, Adrian Satja Kurdija, Lucija Sikic, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
Population-Based Variable Neighborhood Descent for Discrete Optimization. AIMS 2019: 1-12 - Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá, Carlos Alexandre Silva:
Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem. LAGOS 2019: 437-447 - 2018
- Zhizhong Zeng, Xinguo Yu, Kun He, Zhanghua Fu:
Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square. Appl. Soft Comput. 65: 196-213 (2018) - Rodney O. M. Diana, Sérgio Ricardo de Souza, Moacir F. F. Filho:
A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times. Electron. Notes Discret. Math. 66: 191-198 (2018) - Alexandre Frias Faria, Sérgio Ricardo de Souza, Carlos Alexandre Silva:
Variable Neighborhood Descent applied to Multi-way Number Partitioning Problem. Electron. Notes Discret. Math. 66: 103-110 (2018) - Júlia Cária de Freitas, Puca Huachi Vaz Penna:
A Randomized Variable Neighborhood Descent Heuristic to Solve the Flying Sidekick Traveling Salesman Problem. Electron. Notes Discret. Math. 66: 95-102 (2018) - Issam Krimi, Afaf Aloullal, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, David Duvivier:
A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. ICVNS 2018: 232-242 - Dhekra Rezgui, Hend Bouziri, Wassila Aggoune-Mtalaa, Jouhaina Chaouachi Siala:
An Evolutionary Variable Neighborhood Descent for Addressing an Electric VRP Variant. ICVNS 2018: 216-231 - Abraham Duarte, Jesús Sánchez-Oro, Nenad Mladenovic, Raca Todosijevic:
Variable Neighborhood Descent. Handbook of Heuristics 2018: 341-367 - Matthieu De Laere, San Tu Pham, Patrick De Causmaecker:
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent. CoRR abs/1806.06685 (2018)
skipping 31 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-04-24 17: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