Browsing by Author Hansen, Pierre


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 7 to 26 of 65 < previous   next >
Author(s)TitleIssue DateAppears inRank
Hansen, Pierre; Mladenović, Nenad Developments of variable neighborhood search1-Dec-2002Operations Research : Computer Science Interfaces Series; 15; 415-439
Cafieri, Sonia; Hansen, Pierre; Mladenović, Nenad Edge-ratio network clustering by Variable Neighborhood Search1-Jan-2014European Physical Journal B; 87(5)M23
Perron, Sylvain; Hansen, Pierre; Le Digabel, Sébastien; Mladenović, Nenad Exact and heuristic solutions of the global supply chain problem with transfer pricing1-May-2010European Journal of Operational Research; 202(3); 864-879M21a
Hansen, Pierre; Mladenović, Nenad First vs. best improvement: An empirical study1-Apr-2006Discrete Applied Mathematics; 154(5 SPEC. ISS.); 802-817M22
Belacel, Nabil; Hansen, Pierre; Mladenović, Nenad Fuzzy J-Means: A new heuristic for fuzzy clustering1-Jan-2002Pattern Recognition; 35(10); 2193-2200M21
Domínguez-Marín, Patricia; Nickel, Stefan; Hansen, Pierre; Mladenović, Nenad Heuristic procedures for solving the discrete ordered median problem1-Jan-2005Annals of Operations Research; 136(1); 145-173M22
Hansen, Pierre; Mladenović, Nenad ; Taillard, ÉricHeuristic solution of the multisource Weber problem as a p-median problem1-Mar-1998Operations Research Letters; 22(2-3); 55-62M22
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad ; Taillard, EricImprovements and comparison of heuristics for solving the uncapacitated multisource Weber problem1-Jan-2000Operations Research; 48(3); 444-460M21a
Du Merle, Olivier; Hansen, Pierre; Jaumard, Brigitte; Mladenović, Nenad An interior point algorithm for minimum sum-of-squares clustering1-Jan-1999SIAM Journal of Scientific Computing; 21(4); 1485-1505M21a
Hansen, Pierre; Mladenović, Nenad J-Means: a new local search heuristic for minimum sum of squares clustering1-Jan-2001Pattern Recognition; 34(2); 405-413M21
Noble, Steven; Hansen, Pierre; Mladenović, Nenad Maximizing edge-ratio is NP-complete6-Dec-2011Discrete Applied Mathematics; 159(18); 2276-2280M22
Brimberg, Jack; Hansen, Pierre; Laporte, Gilbert; Mladenović, Nenad ; Urošević, Dragan The maximum return-on-investment plant location problem with market share1-Jan-2008Journal of the Operational Research Society; 59(3); 399-406M22
Stevanović, Dragan ; Hansen, PierreThe minimum spectral radius of graphs with a given clique number1-Mar-2008Electronic Journal of Linear Algebra; 17; 110-117M22
Hansen, Pierre; Jaumard, Brigitte; Mladenović, Nenad Minimum sum of squares clustering in a low dimensional space1-Jan-1998Journal of Classification; 15(1); 37-55M21
Davidović, Tatjana ; Hansen, Pierre; Mladenović, Nenad Neighborhood reduction in VNS for multiprocessor scheduling problem2004XXXI Simpozijum o operacionim istraživanjima, SYMOPIS 2004; 225-228M60
Carrizosa, Emilio; Alguwaizani, Abdulrahman; Hansen, Pierre; Mladenović, Nenad New heuristic for harmonic means clustering1-Nov-2015Journal of Global Optimization; 63(3); 427-443M21
Elleuch, Souhir; Hansen, Pierre; Jarboui, Bassem; Mladenović, Nenad New VNP for automatic programming1-Apr-2017Electronic Notes in Discrete Mathematics; 58; 191-198
Mladenović, Nenad ; Brimberg, Jack; Hansen, PierreA note on duality gap in the simple plant location problem1-Oct-2006European Journal of Operational Research; 174(1); 11-22M21
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad A note on reduction of quadratic and bilinear programs with equality constraints1-Jan-2002Journal of Global Optimization; 22(1-4); 39-47M22
Fowler, Patrick; Hansen, Pierre; Stevanović, Dragan A note on the smallest eigenvalue of fullerenes1-Jan-2003Match; 48; 37-48M22