| 2009 | ||
|---|---|---|
| 103 | Pierre Hansen, Nenad Mladenovic: Variable Neighborhood Search Methods. Encyclopedia of Optimization 2009: 3975-3989 | |
| 102 | Charles Audet, Pierre Hansen, Frédéric Messine: Isoperimetric Polygons of Maximum Width. Discrete & Computational Geometry 41(1): 45-60 (2009) | |
| 101 | Charles Audet, Pierre Hansen, Frédéric Messine: Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discrete & Computational Geometry 41(2): 208-215 (2009) | |
| 100 | Pierre Hansen, Christophe Meyer: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. Discrete Applied Mathematics 157(6): 1267-1290 (2009) | |
| 99 | Pierre Hansen, Martine Labbé, David Schindl: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discrete Optimization 6(2): 135-147 (2009) | |
| 98 | Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl: Average distance and maximum induced forest. Journal of Graph Theory 60(1): 31-54 (2009) | |
| 2008 | ||
| 97 | Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighbourhood search: methods and applications. 4OR 6(4): 319-360 (2008) | |
| 96 | Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen: Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. Discrete Applied Mathematics 156(13): 2530-2542 (2008) | |
| 95 | Pierre Hansen, Dragan Stevanovic: On bags and bugs. Discrete Applied Mathematics 156(7): 986-997 (2008) | |
| 94 | Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighborhood search. European Journal of Operational Research 191(3): 593-595 (2008) | |
| 93 | Pierre Hansen, Ceyda Oguz, Nenad Mladenovic: Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 191(3): 636-649 (2008) | |
| 92 | Mustapha Aouchiche, Francis K. Bell, Dragos Cvetkovic, Pierre Hansen, Peter Rowlinson, Slobodan K. Simic, Dragan Stevanovic: Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. European Journal of Operational Research 191(3): 661-676 (2008) | |
| 91 | Pierre Hansen, Sylvain Perron: Merging the local and global approaches to probabilistic satisfiability. Int. J. Approx. Reasoning 47(2): 125-140 (2008) | |
| 90 | Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng, Sylvain Perron: Exact L 2-norm plane separation. Optimization Letters 2(4): 483-495 (2008) | |
| 89 | Pierre Hansen, Nenad Mladenovic: Complement to a comparative analysis of heuristics for the p -median problem. Statistics and Computing 18(1): 41-46 (2008) | |
| 2007 | ||
| 88 | Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leoanardo Silva de Lima: Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. CTW 2007: 1-4 | |
| 87 | Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz: Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG 2007 | |
| 86 | Mustapha Aouchiche, Pierre Hansen: On a conjecture about the Randic index. Discrete Mathematics 307(2): 262-265 (2007) | |
| 85 | Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez: The p. European Journal of Operational Research 179(3): 927-939 (2007) | |
| 84 | Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic: Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. INFORMS Journal on Computing 19(4): 552-564 (2007) | |
| 83 | Pierre Hansen, Sylvain Perron: Algorithms for l1-Embeddability and Related Problems. J. Classification 24(2): 251-275 (2007) | |
| 82 | Charles Audet, Pierre Hansen, Frédéric Messine: The small octagon with longest perimeter. J. Comb. Theory, Ser. A 114(1): 135-150 (2007) | |
| 81 | Pierre Hansen, Nikolaj van Omme: On pitfalls in computing the geodetic number of a graph. Optimization Letters 1(3): 299-307 (2007) | |
| 2006 | ||
| 80 | Pierre Hansen, Nenad Mladenovic, Dragan Urosevic: Variable neighborhood search and local branching. Computers & OR 33(10): 3034-3045 (2006) | |
| 79 | Pierre Hansen, Nenad Mladenovic: First vs. best improvement: An empirical study. Discrete Applied Mathematics 154(5): 802-817 (2006) | |
| 78 | Nenad Mladenovic, Jack Brimberg, Pierre Hansen: A note on duality gap in the simple plant location problem. European Journal of Operational Research 174(1): 11-22 (2006) | |
| 2005 | ||
| 77 | Dominique de Werra, Pierre Hansen: Variations on the Roy-Gallai theorem. 4OR 3(3): 243-251 (2005) | |
| 76 | Patricia Domínguez-Marín, Stefan Nickel, Pierre Hansen, Nenad Mladenovic: Heuristic Procedures for Solving the Discrete Ordered Median Problem. Annals OR 136(1): 145-173 (2005) | |
| 75 | Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi: On uniform k-partition problems. Discrete Applied Mathematics 150(1-3): 121-139 (2005) | |
| 74 | Pierre Hansen, Dragan Stevanovic: On bags and bugs. Electronic Notes in Discrete Mathematics 19: 111-116 (2005) | |
| 73 | Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen, M. Laffay: AutoGraphiX: a survey. Electronic Notes in Discrete Mathematics 22: 515-520 (2005) | |
| 72 | Pierre Hansen, Eric Ngai, Bernard K. Cheung, Nenad Mladenovic: Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. J. Classification 22(2): 287-310 (2005) | |
| 71 | Ivan Gutman, Pierre Hansen, Hadrien Mélot: Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. Journal of Chemical Information and Modeling 45(2): 222-230 (2005) | |
| 2004 | ||
| 70 | Pierre Hansen, Nenad Mladenovic, Dragan Urosevic: Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145(1): 117-125 (2004) | |
| 69 | Gilles Caporossi, Pierre Hansen: Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures. Discrete Mathematics 276(1-3): 81-94 (2004) | |
| 68 | Charles Audet, Pierre Hansen, Frédéric Messine, Sylvain Perron: The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal. J. Comb. Theory, Ser. A 108(1): 63-75 (2004) | |
| 67 | Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic: Cooperative Parallel Variable Neighborhood Search for the p-Median. J. Heuristics 10(3): 293-314 (2004) | |
| 2003 | ||
| 66 | Roberto Aringhieri, Pierre Hansen, Federico Malucelli: Chemical trees enumeration algorithms. 4OR 1(1): 67-83 (2003) | |
| 65 | Gilles Caporossi, Ivan Gutman, Pierre Hansen, Ljiljana Pavlovic: Graphs with maximum connectivity index. Computational Biology and Chemistry 27(1): 85-90 (2003) | |
| 64 | Dominique de Werra, Pierre Hansen: Using stable sets to bound the chromatic number. Inf. Process. Lett. 87(3): 127-131 (2003) | |
| 63 | Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Búsqueda de Entorno Variable. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 19: 77-92 (2003) | |
| 62 | Pierre Hansen, Brigitte Jaumard, Christophe Meyer, Bruno Simeone, Valeria Doring: Maximum Split Clustering Under Connectivity Constraints. J. Classification 20(2): 143-180 (2003) | |
| 61 | Pierre Hansen, Hadrien Mélot: Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index. Journal of Chemical Information and Computer Sciences 43(1): 1-14 (2003) | |
| 60 | Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen: A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons. Journal of Chemical Information and Computer Sciences 43(3): 842-851 (2003) | |
| 59 | Nenad Mladenovic, Martine Labbé, Pierre Hansen: Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. Networks 42(1): 48-64 (2003) | |
| 58 | Jack Brimberg, Pierre Hansen, Keh-Wei Lin, Nenad Mladenovic, Michèle Breton: An Oil Pipeline Design Problem. Operations Research 51(2): 228-239 (2003) | |
| 2002 | ||
| 57 | Xiaofeng Guo, Pierre Hansen, Maolin Zheng: Boundary uniqueness of fusenes. Discrete Applied Mathematics 118(3): 209-222 (2002) | |
| 56 | Pierre Hansen, Brigitte Jaumard, Bruno Simeone: Polynomial algorithms for nested univariate clustering. Discrete Mathematics 245(1-3): 93-105 (2002) | |
| 55 | Stefano Benati, Pierre Hansen: The maximum capture problem with random utilities: Problem formulation and algorithms. European Journal of Operational Research 143(3): 518-530 (2002) | |
| 54 | Michael U. Gerber, Pierre Hansen, Alain Hertz: Extension of Turán's Theorem to the 2-Stability Number. Graphs and Combinatorics 18(3): 479-489 (2002) | |
| 53 | Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen: A constructive enumeration of fusenes and benzenoids. J. Algorithms 45(2): 155-166 (2002) | |
| 52 | Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong: The Largest Small Octagon. J. Comb. Theory, Ser. A 98(1): 46-59 (2002) | |
| 51 | Nabil Belacel, Pierre Hansen, Nenad Mladenovic: Fuzzy J-Means: a new heuristic for fuzzy clustering. Pattern Recognition 35(10): 2193-2200 (2002) | |
| 2001 | ||
| 50 | Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito: Variable Neighborhood Decomposition Search. J. Heuristics 7(4): 335-350 (2001) | |
| 49 | Roberto Aringhieri, Pierre Hansen, Federico Malucelli: A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees. Journal of Chemical Information and Computer Sciences 41(4): 958-963 (2001) | |
| 48 | Pierre Hansen, Nenad Mladenovic: J-MEANS: a new local search heuristic for minimum sum of squares clustering. Pattern Recognition 34(2): 405-413 (2001) | |
| 2000 | ||
| 47 | Gilles Caporossi, Pierre Hansen: Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. Discrete Mathematics 212(1-2): 29-44 (2000) | |
| 46 | Pierre Hansen, Gilles Caporossi: AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory. Electronic Notes in Discrete Mathematics 5: 158-161 (2000) | |
| 45 | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron: Probabilistic satisfiability with imprecise probabilities. Int. J. Approx. Reasoning 24(2-3): 171-189 (2000) | |
| 1999 | ||
| 44 | Pierre Hansen, Brigitte Jaumard, A. D. Parreira: On the Relations between Probabilistic Logic and p-CMS. IJCAI 1999: 56-63 | |
| 43 | Gilles Caporossi, Pierre Hansen: Finding Relations in Polynomial Time. IJCAI 1999: 780-785 | |
| 42 | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron: Probabilistic Satisfiability with Imprecise Probabilities. ISIPTA 1999: 165-174 | |
| 41 | Gilles Caporossi, Ivan Gutman, Pierre Hansen: Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index. Computers & Chemistry 23(5): 469-477 (1999) | |
| 40 | Pierre Hansen, Brigitte Jaumard, Christophe Meyer: On Lower Bounds for Numbered Complete Graphs. Discrete Applied Mathematics 94(1-3): 205-225 (1999) | |
| 39 | Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé: Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. Discrete Applied Mathematics 96-97: 375-393 (1999) | |
| 38 | Olivier du Merle, Daniel Villeneuve, Jacques Desrosiers, Pierre Hansen: Stabilized column generation. Discrete Mathematics 194(1-3): 229-237 (1999) | |
| 37 | Gilles Caporossi, Drago Cvetkovi, Ivan Gutman, Pierre Hansen: Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. Journal of Chemical Information and Computer Sciences 39(6): 984-996 (1999) | |
| 1998 | ||
| 36 | Gilles Caporossi, Pierre Hansen: Enumeration of Polyhex Hydrocarbons to h = 21. Journal of Chemical Information and Computer Sciences 38(4): 610-619 (1998) | |
| 35 | Pierre Hansen, Nenad Mladenovic, Éric D. Taillard: Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. 22(2-3): 55-62 (1998) | |
| 1997 | ||
| 34 | Nenad Mladenovic, Pierre Hansen: Variable neighborhood search. Computers & OR 24(11): 1097-1100 (1997) | |
| 33 | Pierre Hansen, Giovanni Storchi, Tsevi Vovor: Paths with Minimum Range and Ratio of Arc Lengths. Discrete Applied Mathematics 78(1-3): 89-102 (1997) | |
| 32 | Pierre Hansen, Alain Hertz, Nicolas Quinodoz: Splitting trees. Discrete Mathematics 165-166: 403-419 (1997) | |
| 31 | Pierre Hansen, Fuji Zhang, Maolin Zheng: Perfect matchings and ears in elementary bipartite graphs. Discrete Mathematics 176(1-3): 131-138 (1997) | |
| 30 | Pierre Hansen, Brigitte Jaumard: Cluster analysis and mathematical programming. Math. Program. 79: 191-215 (1997) | |
| 1996 | ||
| 29 | Pierre Hansen, Maolin Zheng: Shortest Shortest Path Trees of a Network. Discrete Applied Mathematics 65(1-3): 275-284 (1996) | |
| 1995 | ||
| 28 | Guy-Blaise Douanya Nguetsé, Pierre Hansen, Brigitte Jaumard: Probabilistic Satisfiability and Decomposition. ECSQARU 1995: 151-161 | |
| 27 | Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé, Marcus Poggi de Aragão: Models and Algorithms for Probabilistic and Bayesian Logic. IJCAI 1995: 1862-1868 | |
| 26 | Pierre Hansen, Maolin Zheng: Assigning a Kekulé Structure to a Conjugated Molecule. Computers & Chemistry 19(1): 21-25 (1995) | |
| 25 | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão: Boole's Conditions of Possible Experience and Reasoning under Uncertainty. Discrete Applied Mathematics 60(1-3): 181-193 (1995) | |
| 24 | Pierre Hansen, Brigitte Jaumard, Horst Sachs, Maolin Zheng: Finding a Kekule Structure in a Benzenoid System in Linear Time. Journal of Chemical Information and Computer Sciences 35(3): 561-567 (1995) | |
| 1994 | ||
| 23 | Pierre Hansen, Maolin Zheng: Bonds Fixed by Fixing Bonds. Journal of Chemical Information and Computer Sciences 34(2): 297-304 (1994) | |
| 22 | Pierre Hansen, Maolin Zheng: Numerical Bounds for the Perfect Matching Vectors of a Polyhex. Journal of Chemical Information and Computer Sciences 34(2): 305-308 (1994) | |
| 21 | Pierre Hansen, Brigitte Jaumard, Catherine Lebatteux, Maolin Zheng: Coding Chemical Trees with the Centered N-tuple Code. Journal of Chemical Information and Computer Sciences 34(4): 782-790 (1994) | |
| 1993 | ||
| 20 | Pierre Hansen, Alain Hertz, Julio Kuplinsky: Bounded vertex colorings of graphs. Discrete Mathematics 111(1-3): 305-312 (1993) | |
| 19 | Pierre Hansen, Maolin Zheng: A linear algorithm for perfect matching in hexagonal systems. Discrete Mathematics 122(1-3): 179-196 (1993) | |
| 18 | Pierre Hansen, Brigitte Jaumard, Vincent Mathon: State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming. INFORMS Journal on Computing 5(2): 97-119 (1993) | |
| 1992 | ||
| 17 | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão: Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. IPCO 1992: 165-180 | |
| 16 | Pierre Hansen, Keh-Wei Lih: Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE Trans. Computers 41(6): 769-771 (1992) | |
| 15 | Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu: Global optimization of univariate Lipschitz functions: I. Survey and properties. Math. Program. 55: 251-272 (1992) | |
| 14 | Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu: Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. Math. Program. 55: 273-292 (1992) | |
| 1991 | ||
| 13 | Pierre Hansen, Martine Labbé, Brigitte Nicolas: The continuous center set of a network. Discrete Applied Mathematics 30(2-3): 181-195 (1991) | |
| 12 | Peter L. Hammer, Pierre Hansen, Fred S. Roberts: Acknowledgement. Discrete Applied Mathematics 30(2-3): 99 (1991) | |
| 11 | Pierre Hansen, Julio Kuplinsky: The smallest hard-to-color graph. Discrete Mathematics 96(3): 199-212 (1991) | |
| 10 | Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão: Column Generation Methods for Probabilistic Logic. INFORMS Journal on Computing 3(2): 135-148 (1991) | |
| 9 | Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu: An analytical approach to global optimization. Math. Program. 52: 227-254 (1991) | |
| 8 | Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro: Hyperbolic 0-1 programming and query optimization in information retrieval. Math. Program. 52: 255-263 (1991) | |
| 1990 | ||
| 7 | Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão: Column Generation Methods for Probabilistic Logic. IPCO 1990: 313-331 | |
| 6 | Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro: Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem. Ann. Math. Artif. Intell. 1: 97-109 (1990) | |
| 5 | Pierre Hansen, Dominique de Werra: Preface. Discrete Applied Mathematics 29(2-3): 129 (1990) | |
| 4 | Yves Crama, Pierre Hansen, Brigitte Jaumard: The basic algorithm for pseudo-Boolean programming revisited. Discrete Applied Mathematics 29(2-3): 171-185 (1990) | |
| 3 | Pierre Hansen, Shi-Hui Lu, Bruno Simeone: On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization. Discrete Applied Mathematics 29(2-3): 187-193 (1990) | |
| 1976 | ||
| 2 | Pierre Hansen: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. Inf. Process. Lett. 5(2): 50-54 (1976) | |
| 1 | Pierre Hansen: Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. Inf. Process. Lett. 5(4): 124 (1976) | |