default search action
Electronic Notes in Discrete Mathematics, Volume 39
Volume 39, December 2012
- Angelo Sifaleras, Dragan Urosevic, Nenad Mladenovic:
EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search. 1-4 - Ivan A. Davydov, Yury Kochetov, Emilio Carrizosa:
VNS heuristic for the (r|p)-centroid problem on the plane. 5-12 - Abdulrahman Alguwaizani:
Degeneracy on K-means clustering. 13-20 - Jozef Kratica, Markus Leitner, Ivana Ljubic:
Variable Neighborhood Search for Solving the Balanced Location Problem. 21-28 - Z. Diakova, Yury Kochetov:
A double VNS heuristic for the facility location and pricing problem. 29-34 - Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti:
Hybrid Metaheuristic for Bicluster Editing Problem. 35-42 - Miroslav Maric, Zorica Stanimirovic, Nikola Milenkovic:
Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences. 43-50 - Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Variable neighborhood search for the strong metric dimension problem. 51-57 - Jesús Sánchez-Oro, Abraham Duarte:
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems. 59-66 - Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte:
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem. 67-74 - Sergio Consoli, José A. Moreno-Pérez:
Solving the minimum labelling spanning tree problem using hybrid local search. 75-82 - Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
An efficient GVNS for solving Traveling Salesman Problem with Time Windows. 83-90 - Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi:
A variable neighborhood search for the multi-product inventory routing problem. 91-98 - Igor Machado Coelho, Pablo Luiz Araújo Munhoz, Matheus Nohra Haddad, Marcone Jamilson Freitas Souza, Luiz Satoru Ochi:
A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups. 99-106 - Le Liu, Hong Zhou:
Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem. 107-114 - Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo, Nenad Mladenovic:
VNS based algorithm for solving a 0-1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management. 115-120 - Sanja Roksandic, Emilio Carrizosa, Dragan Urosevic, Nenad Mladenovic:
Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics. 121-128 - Qiuhong Zhao, Chao Xie, Yiyong Xiao:
A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems. 129-135 - Yiyong Xiao, Yun Tian, Qiuhong Zhao:
Discovering Frequent Itemset with Maximum Time-Window on Temporal Transaction Database using Variable Neighborhood Search. 137-144 - Nina Turajlic, Ivana Dragovic:
A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem. 145-152 - Raca Todosijevic, Marko Mladenovic, Saïd Hanafi, Igor Crévits:
VNS based heuristic for solving the Unit Commitment problem. 153-160 - Dragan Matic, Jozef Kratica, Vladimir Filipovic, Djordje Dugosija:
Variable neighborhood search for Multiple Level Warehouse Layout Problem. 161-168 - Samuel S. Brito, George H. G. Fonseca, Túlio A. M. Toffolo, Haroldo G. Santos, Marcone J. F. Souza:
A SA-VNS approach for the High School Timetabling Problem. 169-176 - Nina Turajlic, Sinisa Neskovic:
Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem. 177-184 - Igor Grujicic, Zorica Stanimirovic:
Variable neighborhood search method for optimizing the emergency service network of police special forces units. 185-192 - Nebojsa Nikolic, Igor Grujicic, Dorde Dugosija:
Variable neighborhood descent heuristic for covering design problem. 193-200 - Rym M'Hallah, Abdulaziz Alkandari:
Packing Unit Spheres into a Cube Using VNS. 201-208 - Haris Gavranovic, Mirsad Buljubasic, Emir Demirovic:
Variable Neighborhood Search for Google Machine Reassignment problem. 209-216 - R. C. Cruz, T. C. B. Silva, Marcone J. F. Souza, Vitor Nazário Coelho, Marcio Tadayuki Mine, Alexandre Xavier Martins:
GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery. 217-224 - Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Saïd Salhi:
Generating good starting solutions for the p-median problem in the plane. 225-232 - Vitor Nazário Coelho, Marcone J. F. Souza, Igor Machado Coelho, Frederico G. Guimarães, Thibaut Lust, R. C. Cruz:
Multi-objective approaches for the open-pit mining operational planning problem. 233-240 - Tatjana Davidovic, Teodor Gabriel Crainic:
MPI Parallelization of Variable Neighborhood Search. 241-248 - Arturo Rodríguez-Cristerna, Jose Torres-Jimenez:
A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays. 249-256 - Darko Kovacevic, Bratislav Petrovic, Pavle Milosevic:
Estimating Differential Evolution crossover parameter with VNS approach for continuous global optimization. 257-264 - Samir Loudni, Mathieu Fontaine, Patrice Boizumault:
Exploiting Separators for Guiding VNS. 265-272 - Ivan Nesic, Aleksandar Rakicevic, Ana Poledica, Bratislav Petrovic:
Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization. 273-280 - Ulrich Derigs, Markus Pullmann, Ulrich Vogel, Marco Oberscheider, Manfred Gronalt, Patrick Hirsch:
Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation. 281-288 - Yingcheng Xu, Li Wang, Yuexiang Yang:
A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows. 289-296
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.