Browsing by Author Urošević, Dragan


Or, select a letter below to browse by last name
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 102 to 109 of 109 < previous 
Author(s)TitleIssue DateAppears inRank
Hansen, Pierre; Mladenović, Nenad ; Urošević, Dragan Variable Neighborhood Search for the SPLP - The Sliding Simplex Algorithm2002ISOLDE IX, Fredericton, New Brunswick; 17-17M30
Mladenović, Nenad ; Urošević, Dragan ; Hanafi, SaïdVariable neighborhood search for the travelling deliveryman problem1-Jan-20134OR : A Quarterly Journal of Operations Research; 11(1); 57-73M22
Brimberg, Jack; Urošević, Dragan ; Mladenović, Nenad Variable neighborhood search for the vertex weighted k-cardinality tree problem16-May-2006European Journal of Operational Research; 171(1); 74-84M21
Ivanović, Marija; Urošević, Dragan Variable Neighborhood Search Solution for some variants of the Roman Domination problem20164th International Conference on VNS; 23-23M30
Lazić, Jasmina; Hanafi, Saïd; Mladenović, Nenad ; Urošević, Dragan Variable neighbourhood decomposition search for 0-1 mixed integer programs1-Jun-2010Computers and Operations Research; 37(6); 1055-1067M21
Mladenović, Nenad ; Urošević, Dragan ; Pérez-Brito, Dionisio; García-González, CarlosVariable neighbourhood search for bandwidth reduction1-Jan-2010European Journal of Operational Research; 200(1); 14-27
Tintor, Vladica; Urošević, Dragan ; Anđelić, B.; Radunović, Jovan; Mladenović, Nenad Variable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks23-Sep-2011IET Communications; 5(14); 2028-2034M22
Urošević, Dragan ; Brimberg, Jack; Mladenović, Nenad VNDS for k-cardinality trees2002XXIX SYM-OP-IS; 9-12M60