Showing results 16 to 35 of 65
< previous
next >
| Author(s) | Title | Issue Date | Appears in | Rank |
| Hansen, Pierre; Mladenović, Nenad | J-Means: a new local search heuristic for minimum sum of squares clustering | 1-Jan-2001 | Pattern Recognition; 34(2); 405-413 | M21 |
| Noble, Steven; Hansen, Pierre; Mladenović, Nenad | Maximizing edge-ratio is NP-complete | 6-Dec-2011 | Discrete Applied Mathematics; 159(18); 2276-2280 | M22 |
| Brimberg, Jack; Hansen, Pierre; Laporte, Gilbert; Mladenović, Nenad ; Urošević, Dragan | The maximum return-on-investment plant location problem with market share | 1-Jan-2008 | Journal of the Operational Research Society; 59(3); 399-406 | M22 |
| Stevanović, Dragan ; Hansen, Pierre | The minimum spectral radius of graphs with a given clique number | 1-Mar-2008 | Electronic Journal of Linear Algebra; 17; 110-117 | M22 |
| Hansen, Pierre; Jaumard, Brigitte; Mladenović, Nenad | Minimum sum of squares clustering in a low dimensional space | 1-Jan-1998 | Journal of Classification; 15(1); 37-55 | M21 |
| Davidović, Tatjana ; Hansen, Pierre; Mladenović, Nenad | Neighborhood reduction in VNS for multiprocessor scheduling problem | 2004 | XXXI Simpozijum o operacionim istraživanjima, SYMOPIS 2004; 225-228 | M60 |
| Carrizosa, Emilio; Alguwaizani, Abdulrahman; Hansen, Pierre; Mladenović, Nenad | New heuristic for harmonic means clustering | 1-Nov-2015 | Journal of Global Optimization; 63(3); 427-443 | M21 |
| Elleuch, Souhir; Hansen, Pierre; Jarboui, Bassem; Mladenović, Nenad | New VNP for automatic programming | 1-Apr-2017 | Electronic Notes in Discrete Mathematics; 58; 191-198 | |
| Mladenović, Nenad ; Brimberg, Jack; Hansen, Pierre | A note on duality gap in the simple plant location problem | 1-Oct-2006 | European Journal of Operational Research; 174(1); 11-22 | M21 |
| Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad | A note on reduction of quadratic and bilinear programs with equality constraints | 1-Jan-2002 | Journal of Global Optimization; 22(1-4); 39-47 | M22 |
| Fowler, Patrick; Hansen, Pierre; Stevanović, Dragan | A note on the smallest eigenvalue of fullerenes | 1-Jan-2003 | Match; 48; 37-48 | M22 |
| Brimberg, Jack; Hansen, Pierre; Lih, Keh Wei; Mladenović, Nenad ; Breton, Michèle | An oil pipeline design problem | 1-Jan-2003 | Operations Research; 51(2) | M21 |
| Hansen, Pierre; Stevanović, Dragan | On bags and bugs | 1-Apr-2008 | Discrete Applied Mathematics; 156(7); 986-997 | M22 |
| Randel, Rodrigo; Aloise, Daniel; Mladenović, Nenad ; Hansen, Pierre | On the k-Medoids Model for Semi-supervised Clustering | 1-Jan-2019 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 6th International Conference on Variable Neighborhood Search, ICVNS 2018; Sithonia; Greece; 4 October 2018 through 7 October 2018; 11328 LNCS; 13-27 | M33 |
| Stevanović, Dragan ; Aouchiche, Mustapha; Hansen, Pierre | On the spectral radius of graphs with a given domination number | 15-Apr-2008 | Linear Algebra and Its Applications; 428(8-9); 1854-1864 | M22 |
| Mladenović, Nenad ; Brimberg, Jack; Hansen, Pierre; Moreno-Pérez, José | The p-median problem: A survey of metaheuristic approaches | 16-Jun-2007 | European Journal of Operational Research; 179(3); 927-939 | M21 |
| Moreno Pérez, José A.; Hansen, Pierre; Mladenović, Nenad | Parallel Variable Neighborhood Search | 16-Sep-2005 | Parallel Metaheuristics: A New Class of Algorithms; 247-266 | |
| Davidović, Tatjana ; Hansen, Pierre; Mladenović, Nenad | Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays | 1-Jan-2005 | Asia-Pacific Journal of Operational Research; 22(3); 297-326 | M23 |
| Audet, Charles; Brimberg, Jack; Hansen, Pierre; Le Digabel, Sébastien; Mladenović, Nenad | Pooling problem: Alternate formulations and solution methods | 1-Jun-2004 | Management Science; 50(6); 761-776 | M21a |
| Hansen, Pierre; Brimberg, Jack; Urošević, Dragan ; Mladenović, Nenad | Primal-dual variable neighborhood search for the simple plant-location problem | 1-Jan-2007 | INFORMS Journal on Computing; 19(4); 552-564 | M21a |
