First vs. best improvement : An empirical studyHANSEN, Pierre; MIADENOVI, Nenad.Discrete applied mathematics. 2006, Vol 154, Num 5, pp 802-817, issn 0166-218X, 16 p.Conference Paper

Solving the unconstrained optimization problem by a variable neighborhood searchTOKSARI, M. Duran; GÜNER, Ertan.Journal of mathematical analysis and applications. 2007, Vol 328, Num 2, pp 1178-1187, issn 0022-247X, 10 p.Article

Variable neighborhood search and local branchingHANSEN, Pierre; MLADENOVIC, Nenad; UROSEVIC, Dragan et al.Computers & operations research. 2006, Vol 33, Num 10, pp 3034-3045, issn 0305-0548, 12 p.Article

Variable neighborhood search for the heaviest k-subgraphBRIMBERG, Jack; MLADENOVIC, Nenad; UROSEVIC, Dragan et al.Computers & operations research. 2009, Vol 36, Num 11, pp 2885-2891, issn 0305-0548, 7 p.Article

Heuristics for the multi-period orienteering problem with multiple time windowsTRICOIRE, Fabien; ROMAUCH, Martin; DOERNER, Karl F et al.Computers & operations research. 2010, Vol 37, Num 2, pp 351-367, issn 0305-0548, 17 p.Article

A variable neighborhood search heuristic for periodic routing problemsHEMMELMAYR, Vera C; DOERNER, Karl F; HARTL, Richard F et al.European journal of operational research. 2009, Vol 195, Num 3, pp 791-802, issn 0377-2217, 12 p.Conference Paper

Variable neighborhood search for the pharmacy duty scheduling problemKOCATÜRK, Fatih; ÖZPEYNIRCI, Özgür.Computers & operations research. 2014, Vol 51, pp 218-226, issn 0305-0548, 9 p.Article

Variable neighborhood search for the dial-a-ride problemPARRAGH, Sophie N; DOERNER, Karl F; HARTL, Richard F et al.Computers & operations research. 2010, Vol 37, Num 6, pp 1129-1138, issn 0305-0548, 10 p.Article

A variable neighborhood search based algorithm for finite-horizon Markov Decision ProcessesQIU HONG ZHAO; BRIMBERG, Jack; MLADENOVIC, Nenad et al.Applied mathematics and computation. 2010, Vol 217, Num 7, pp 3480-3492, issn 0096-3003, 13 p.Article

The double traveling salesman problem with multiple stacks: A variable neighborhood search approachFELIPE, Angel; ORTUNO, M. Teresa; TIRADO, Gregorio et al.Computers & operations research. 2009, Vol 36, Num 11, pp 2983-2993, issn 0305-0548, 11 p.Article

A neural network algorithm for the traveling salesman problem with backhaulsGHAZIRI, Hassan; OSMAN, Ibrahim H.Computers & industrial engineering. 2003, Vol 44, Num 2, pp 267-281, issn 0360-8352, 15 p.Article

An efficient variable neighborhood search heuristic for very large scale vehicle routing problemsKYTÖJOKI, Jari; NUORTIO, Teemu; BRAYSY, Olli et al.Computers & operations research. 2007, Vol 34, Num 9, pp 2743-2757, issn 0305-0548, 15 p.Article

Variable neighborhood search for the vertex weighted k-cardinality tree problemBRIMBERG, J; UROSEVIC, D; MLADENOVIC, N et al.European journal of operational research. 2006, Vol 171, Num 1, pp 74-84, issn 0377-2217, 11 p.Article

Variable neighborhood search for the maximum cliqueHANSEN, Pierre; MLADENOVIC, Nenad; UROSEVIC, Dragan et al.Discrete applied mathematics. 2004, Vol 145, Num 1, pp 117-125, issn 0166-218X, 9 p.Conference Paper

The minisum multipurpose trip location problem on networksBERMAN, Oded; RONGBING HUANG.Transportation science. 2007, Vol 41, Num 4, pp 500-515, issn 0041-1655, 16 p.Article

Solving the p-Center problem with tabu Search and Variable Neighborhood SearchMLADENOVIC, Nenad; LABBE, Martine; HANSEN, Pierre et al.Networks (New York, NY). 2003, Vol 42, Num 1, pp 48-64, issn 0028-3045, 17 p.Article

Variable Neighborhood Search based algorithms for high school timetablingFONSECA, George H. G; SANTOS, Haroldo G.Computers & operations research. 2014, Vol 52, pp 203-208, issn 0305-0548, 6 p., bArticle

The traveling purchaser problem with budget constraintMANSINI, Renata; TOCCHELLA, Barbara.Computers & operations research. 2009, Vol 36, Num 7, pp 2263-2274, issn 0305-0548, 12 p.Article

Heuristic Algorithms for Constructing Binary Constant Weight CodesMONTEMANNI, Roberto; SMITH, Derek H.IEEE transactions on information theory. 2009, Vol 55, Num 10, pp 4651-4656, issn 0018-9448, 6 p.Article

Solución al problema de empaquetamiento bidimensional usando un algoritmo hibrido constructivo de bùsqueda en vecindad variable y recocido simulado = Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealingMIRLEDY TORO, Eliana; GARCES, Alejandro; RUIZ, Hugo et al.Revista Facultad de Ingeniería Universidad de Antioquia. 2008, Num 46, pp 119-131, issn 0120-6230, 13 p.Article

A Hybrid Solution Approach for Ready-Mixed Concrete DeliverySCHMID, Verena; DOERNER, Karl F; HARTL, Richard F et al.Transportation science. 2009, Vol 43, Num 1, pp 70-85, issn 0041-1655, 16 p.Article

A Heuristic Two-Phase Solution Approach for the Multi-Objective Dial-A-Ride ProblemPARRAGH, Sophie N; DOERNER, Karl F; HARTL, Richard F et al.Networks (New York, NY). 2009, Vol 54, Num 4, pp 227-242, issn 0028-3045, 16 p.Conference Paper

VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR SELECTING A SUBSET OF VARIABLES IN PRINCIPAL COMPONENT ANALYSISBRUSCO, Michael J; SINGH, Renu; STEINLEY, Douglas et al.Psychometrika. 2009, Vol 74, Num 4, pp 705-726, issn 0033-3123, 22 p.Article

A GRASP with evolutionary path relinking for the truck and trailer routing problemVILLEGAS, Juan G; PRINS, Christian; PRODHON, Caroline et al.Computers & operations research. 2011, Vol 38, Num 9, pp 1319-1334, issn 0305-0548, 16 p.Article

Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problemPARRAGH, Sophie N.Transportation research. Part C, Emerging technologies. 2011, Vol 19, Num 5, pp 912-930, issn 0968-090X, 19 p.Conference Paper