![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Electronic Notes in Discrete Mathematics, Volume 47
Volume 47, February 2015
- Bassem Jarboui
, Angelo Sifaleras
, Abdelwaheb Rebaï:
3rd International Conference on Variable Neighborhood Search (VNS'14). 1-4 - Aleksey V. Khmelev, Yury Kochetov
:
A hybrid VND method for the split delivery vehicle routing problem. 5-12 - Sergio Consoli
, Nikolaos I. Stilianakis:
A VNS-based quartet algorithm for biomedical literature clustering. 13-20 - Adil I. Erzin
, Roman V. Plotnikov
:
Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks. 21-28 - Sergio Consoli
, José Andrés Moreno-Pérez
:
Variable neighbourhood search for the k-labelled spanning forest problem. 29-36 - Roberto Aringhieri
, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
VNS solutions for the Critical Node Problem. 37-44 - Noureddine Bouhmala, Karina Hjelmervik
, Kjell Ivar Øvergård:
A Generalized Variable Neighborhood Search For Combinatorial Optimization Problems. 45-52 - Ivan A. Davydov
, Yury Kochetov
:
VNS-based heuristic with an exponential neighborhood for the server load balancing problem. 53-60 - Feng Ye, Qiuhong Zhao, Menghao Xi, Maged M. Dessouky:
Chinese National Emergency Warehouse Location Research based on VNS Algorithm. 61-68 - Angelo Sifaleras
, Ioannis Konstantaras
:
General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain. 69-76 - Borja Menéndez
, Eduardo G. Pardo
, Abraham Duarte, Antonio Alonso-Ayuso
, Elisenda Molina
:
General Variable Neighborhood Search applied to the picking process in a warehouse. 77-84 - Jesús Sánchez-Oro
, Marc Sevaux
, André Rossi
, Rafael Martí, Abraham Duarte:
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. 85-92 - Abdelkader Ouali
, Samir Loudni, Lakhdar Loukil, Patrice Boizumault, Yahia Lebbah:
Replicated Parallel Strategies for Decomposition Guided VNS. 93-100 - Ezzeddine Fatnassi, Jouhaina Chaouachi Siala:
VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems. 101-108 - Arturo Rodríguez-Cristerna, José Torres-Jiménez
, Wilfrido Gómez-Flores
, Wagner Coelho A. Pereira:
Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search. 109-116 - Nadia Dahmani
, Saoussen Krichen
, Dhouha Ghazouani:
A variable neighborhood descent approach for the two-dimensional bin packing problem. 117-124 - Fatima Zohra Lebbah, Yahia Lebbah:
VNS approach for solving a financial portfolio design problem. 125-132 - Frederico Dusberger, Günther R. Raidl:
Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. 133-140 - Igor Grujicic, Günther R. Raidl, Andreas Schöbel:
Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. 141-148 - Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. 149-156 - Meriem Khelifa, Dalila Boughaci
:
A Variable Neighborhood Search Method for Solving the Traveling Tournaments Problem. 157-164 - Olfa Chebbi, Jouhaina Chaouachi Siala:
Multi-objective Iterated Greedy Variable Neighborhood Search Algorithm For Solving a full-load automated guided vehicle routing problem with battery constraints. 165-172 - Roberto Aringhieri
, Paolo Landa
, Elena Tanfani
:
Assigning surgery cases to operating rooms: A VNS approach for leveling ward beds occupancies. 173-180 - Brahim Issaoui, Issam Zidi
, Eric Marcon
, Khaled Ghédira:
New Multi-Objective Approach for the Home Care Service Problem Based on Scheduling Algorithms and Variable Neighborhood Descent. 181-188 - Ons Abdelkhalek, Hela Masri, Saoussen Krichen
:
An adaptive variable neighborhood search for solving the multi-objective node placement problem. 189-196 - Hadhami Kaabi, Khaled Jabeur
, Lamia Enneifar:
Learning criteria weights with TOPSIS method and continuous VNS for multi-criteria inventory classification. 197-204 - Thays A. Oliveira, Vitor Nazário Coelho, Marcone J. F. Souza
, D. L. T. Boava, F. Boava, Igor Machado Coelho, Bruno N. Coelho
:
A hybrid variable neighborhood search algorithm for targeted offers in direct marketing. 205-212 - B. S. Zhikharevich, O. V. Rusetskay, Nenad Mladenovic
:
Clustering cities based on their development dynamics and Variable neigborhood search. 213-220 - Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane
, Stefano Suraci:
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows. 221-228 - Amine Dhahri, Kamel Zidi
, Khaled Ghédira:
A Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows and Preventive Maintenance Activities. 229-236 - Maurizio Bruglieri, Eliane Gerzelj, Andrea Guenzani, Roberto Maja, Rodrigo de Alvarenga Rosa:
Solving the 3-D Yard Allocation Problem for Break Bulk Cargo via Variable Neighborhood Search Branching. 237-244 - Mouaouia Cherif Bouzid
, Hacène Aït Haddadène, Saïd Salhi
:
Splitting a Giant Tour using Integer Linear Programming. 245-252 - Francisco Gortázar
, Rubén Carrasco, AnThanh Pham Trinh, Micael Gallego
, Abraham Duarte:
VNS variants for the Max-Mean Dispersion Problem. 253-260 - Stefan Miskovic, Zorica Stanimirovic
, Igor Grujicic:
An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network. 261-268 - Said Toumi
, Mohamed Cheikh, Bassem Jarboui
:
0 - 1 Quadratic Knapsack Problem solved with VNS algorithm. 269-276 - Mohamed Cheikh, Mustapha Ratli, Omar Mkaouar, Bassem Jarboui
:
A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. 277-284 - Manel Kammoun, Houda Derbel, Mustapha Ratli, Bassem Jarboui
:
A variable neighborhood search for solving the multi-vehicle covering tour problem. 285-292
![](https://dblp.dagstuhl.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.