default search action
Electronic Notes in Discrete Mathematics, Volume 58
Volume 58, April 2017
- Eduardo G. Pardo, Angelo Sifaleras:
4th International Conference on Variable Neighborhood Search (ICVNS'16). 1-5 - Samuel Souza Brito, Haroldo Gambini Santos:
Automatic integer programming reformulation using variable neighborhood search. 7-14 - Thays A. Oliveira, Vitor Nazário Coelho, Helena R. Lourenço, Marcone J. F. Souza, Bruno N. Coelho, Daniel C. Rezende, Igor Machado Coelho:
A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities. 15-22 - Olivera Jankovic, Zorica Stanimirovic:
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem. 23-30 - Rafael A. M. Gomes, Túlio A. M. Toffolo, Haroldo Gambini Santos:
Variable neighborhood search accelerated column generation for the nurse rostering problem. 31-38 - Yury Kochetov, A. Kondakov:
VNS matheuristic for a bin packing problem with a color constraint. 39-46 - Nikolaos Antoniadis, Angelo Sifaleras:
A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems. 47-54 - Vívian Ludimila Aguiar Santos, José Elías C. Arroyo:
Iterated Greedy with Random Variable Neighborhood Descent for Scheduling Jobs on Parallel Machines with Deterioration Effect. 55-62 - Sana Frifita, Malek Masmoudi, Jalel Euchi:
General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits. 63-70 - Samia Hasni, Said Toumi, Bassem Jarboui, Anis Mjirda:
GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem. 71-78 - Vitor Nazário Coelho, Igor Machado Coelho, Bruno N. Coelho, Marcone J. F. Souza, Frederico G. Guimarães, Eduardo José da S. Luz, Alexandre C. Barbosa, Mateus N. Coelho, Guilherme G. Netto, R. C. Costa, Alysson A. Pinto, A. de P. Figueiredo, M. E. V. Elias, D. C. O. G. Filho, Thays A. Oliveira:
EEG time series learning and classification using a hybrid forecasting model calibrated with GVNS. 79-86 - Alba Agustín, Angel A. Juan, Eduardo G. Pardo:
A variable neighborhood search approach for the crew pairing problem. 87-94 - Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane, Stefano Suraci:
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges. 95-102 - Jerzy Duda:
A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem. 103-110 - Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. 111-118 - Rahma Borchani, Abdelkerim Elloumi, Malek Masmoudi:
Variable neighborhood descent search based algorithms for course timetabling problem: Application to a Tunisian University. 119-126 - Israel López-Plata, Christopher Expósito Izquierdo, Belén Melián-Batista, José Marcos Moreno-Vega:
Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals. 127-133 - Ana Anokic, Zorica Stanimirovic, Tatjana Davidovic, Dorde Stakic:
Variable neighborhood search for optimizing the transportation of agricultural raw materials. 135-142 - Shima Golmohamadi, Reza Tavakkoli-Moghaddam, Mostafa Hajiaghaei-Keshteli:
Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic. 143-150 - Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo, Nenad Mladenovic:
On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework. 151-158 - Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A general framework for nested variable neighborhood search. 159-166 - Leslie Pérez Cáceres, Thomas Stützle:
Exploring variable neighborhood search for automatic algorithm configuration. 167-174 - Marwa Harzi, Saoussen Krichen:
Variable neighborhood descent for solving the vehicle routing problem with time windows. 175-182 - Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Abraham Duarte, Rafael Martí:
Variable neighborhood descent for the incremental graph drawing. 183-190 - Souhir Elleuch, Pierre Hansen, Bassem Jarboui, Nenad Mladenovic:
New VNP for automatic programming. 191-198 - Eyder Rios, Luiz Satoru Ochi, Cristina Boeres, Igor Machado Coelho, Vitor Nazário Coelho, Nenad Mladenovic:
A performance study on multi improvement neighborhood search strategy. 199-206 - Cézar Augusto N. e Silva, Haroldo Gambini Santos:
Drawing graphs with mathematical programming and variable neighborhood search. 207-214 - Rita Macedo, Rachid Benmansour, Abdelhakim Artiba, Nenad Mladenovic, Dragan Urosevic:
Scheduling preventive railway maintenance activities with resource constraints. 215-222 - Olga Rusetskaya:
Grouping cities based of their socio-economic indicators. 223-230 - Marwa Amous, Said Toumi, Bassem Jarboui, Mansour Eddaly:
A variable neighborhood search algorithm for the capacitated vehicle routing problem. 231-238 - Danijela Doric, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Clustering approach in maintenance of capillary railway network. 239-246
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.