1. Boros, E., Crama, Y., De Werra, D., Hansen, P., Maffray, F. (eds.), « The Mathematics of Peter L. Hammer (1936-2006): Graphs, optimization, and Boolean Models », Annals of Operations Research, Vol. 188, Springer 2011.
  2. Pardalos, P.M., Hansen, P. (eds.), « Data Mining and Mathematical Programming », CRM Proceedings and Lecture Notes, Vol. 45, American Mathematical Society, Providence, RI, 2008.
  3. Audet, C. Hansen, P., Savard, G. (eds.), « Essays and Surveys in Global Optimization », Kluwer, Dordrecht, 2005.
  4. Fajtlowicz, S., Fowler, P., Janowitz, M., Hansen, P., Roberts, F.S. (eds.), « Graphs and Discovery », AMS, Providence, RI, 2005.
  1. Aloise, D., Hansen, P., « Clustering », in Handbook of Discrete and Combinatorial Optimization, 2011 (à paraître).
  2. Caporossi, G., Hansen, P., Mladenovic, N., »Variable Neighborhood Search », in Metaheuristics, P. Siarry, 77-98, 2016.
  3. Brimberg, J., Hansen, P., Mladenović, N., « Continuous Optimization by Variable Neighborhood Search », Wiley Encyclopedia of Operations Research and Management Science, 2015.
  4. Aouchiche, M., Caporossi, G., Hansen, P., Mladenovic, N., Lucas, C., « Finding conjectures in graph theory with AutoGraphiX », in Advances in Software Engineering and Systems. Recent Advances in Computer Engineering Series, N. E. Mastorakis and K. Psarris (eds.), 27, 42-51, 2015.
  5. Cafieri, S., Hansen, P., Mladenovic, N., « Variable Neighborhood Search for edge-ratio network clustering », In Examining Robustness and Vulnerability of Networked Systems, S. Butenko et al. (Eds.), 51-64, 2014.
  6. Hansen, P., Meyer, C., « A Polynomial Algorithm for a Class of 0-1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering », in Clusters, Orders, and Trees: Methods and Applications, Fuad Aleskerov, Boris Goldengorin, Panos M. Pardalos (eds.), 13-50, 2014.
  7. Cafieri, S., Hansen, P., « Using mathematical programming to refine heuristic solutions for network clustering », in Models, Algorithms and Technologies for Network Analysis, 9-20, 2014.
  8. Hansen, P., Mladenović, N., Brimberg, J., Moreno Pérez, J., « Variable Neighborhood Search », in Handbook of Metaheuristics, Series in Operational Research and Management Science (2nd edition), 146, 61-86, 2010.
  9. Audet, C., Hansen, P., Messine, F., « Extremal Problems for Convex Polygons – An Update », in Lectures on Global optimization, P.M. Pardalos, T.F. Coleman (eds.), Fields Institute Communications, American Mathematical Society, 1-16, 2009.
  10. Hansen, P., Mladenović, N., « Variable Neighborhood Search Methods », in Handbook of Applied Optimization (2nd edition), C. Floudas, P. Pardalos (eds.), 3978-3989, 2009.
  11. Aouchiche, M., Hansen, P., « Automated Results and Conjectures on Average Distance in Graphs », in Game Theory in Paris: Special Volume in Memory of Claude Berge, J.A. Bondy, J. Fonlupt, J.L. Fouquet, J.C. Fournier, L. Ramirez-Alfonsin (eds.), 21-36, 2007.
  12. Aouchiche, M., Bonnefoy, J.-M., Fidahoussen, A., Caporossi, G., Hansen, P., Hiesse, L., Lacheré, J., Monhait, A., « Variable Neighborhood Search for Extremal Graphs, 14. The AutoGraphiX 2 System », in Global Optimization: from Theory to Implementation, L. Liberti,N. Maculan (eds.), Springer, 84, 281–310, 2006.
  13. Hansen, P., Mladenović, N., « Variable neighborhood search », in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E.K. Burke, G. Kendall (eds.), Springer, 211–238, 2005.
  14. Moreno-Perez, J.A., Hansen, P., Mladenović, N., « Parallel variable neighborhood search », in Parallel Metaheuristics: A new class of algorithms, E. Alba (eds.), Wiley, 247–266, 2005.
  15. Belhaiza, S., De Abreu, N., Hansen, P., Oliveira, C.S., « Variable Neighborhood Search for Extremal Graphs. 11. Bounds on Algebraic Connectivity », in Graphs and Combinatorial Optimization, D. Avis, A. Hertz, O. Marcotte (eds.), Springer, New York, 1–16, 2005.
  16. Hansen, P., « How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? », in Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, S. Fajtlowicz, P.W. Fowler, P. Hansen, M.F. Janowitz, F.S. Roberts (eds.), AMS, Providence, RI, 69, 189–230, 2005.
  17. Hansen, P., Aouchiche, M., Caporossi, G., Mélot, H., Stevanovic, D., « What Forms Do Interesting Conjectures Have in Graph Theory? », in Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, S. Fajtlowicz, P.W. Fowler, P. Hansen, M.F. Janowitz, F.S. Roberts (eds.), AMS, Providence, RI, 69, 231–252, 2005.
  18. Hansen, P., Mélot, H., « Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph », in Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, S. Fajtlowicz, P.W. Fowler, P. Hansen, M.F. Janowitz, F.S. Roberts (eds.), AMS, Providence, RI, 69, 253–264, 2005.
  19. Audet, C., Hansen, P., Le Digabel, S., « Exact Solution of Three Nonconvex Quadratic Programming Problem », in Frontiers in Global Optimization, Nonconvex Optm. Appl. 74 (2004) 25–43.
  1. Mjirda, A., Todosijević, R., Hanafi, S., Hansen, P., Mladenović, N., « Sequential variable neighborhood descent variants: An empirical study on travelling salesman problem », International Transactions of Operations Research, 24(3), 615-633, 2017.
  2. Aouchiche, M., Hansen, P., « Proximity, remoteness and distance eigenvalues of a graph », Discrete Applied Mathematics, 213, 17-25, 2016.
  3. Aouchiche, M., Hansen, P., « On the distance signle Laplacian of a graph »,  Linear and Multilinear Algebra, 64(6), 1113-1123, 2016
  4. Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenovic, N., « New heuristic for harmonic means clustering », Journal of Global Optimization, 63(3), 427-443, novembre 2015.
  5. Ninin, J., Messine, F., Hansen, P., « A reliable affine relaxation method for global optimization », 4OR, 13(3), 247-277, septembre 2015.
  6. Cafieri, S., Costa, A., Hansen, P., « Adding cohesion constraints to models for modularity maximization in networks », Journal of Complex Networks, 3(3), 388–410, septembre 2015.
  7. Bettinelli, A., Hansen, P., Liberti, L., « Community Detection with the Weighted Parsimony Criterion », Journal of Systems Science and Complexity, 28(3), 517-545, juin 2015.
  8. Saboonchi, B., Hansen, P., Perron, S., « MaxMinMin p-dispersion problem: A variable neighborhood search approach », Computers & Operations Research, 52, Part B, 251-259, décembre 2014.
  9. Belhaiza, S., Hansen, P., Laporte, G., « A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows », Computers & Operations Research, 52, Part B, 269-281, décembre 2014.
  10. Cafieri, S., Costa, A., Hansen, P., « Reformulation of a model for hierarchical divisive graph modularity maximization », Annals of Operations Research, 222(1), 213-226, novembre 2014.
  11. Aloise, D., Hansen, P., Rocha, C., Santi, É., « Column generation bounds for numerical microaggregation », Journal of Global Optimization, 60(2), 165-182, octobre 2014.
  12. Aouchiche, M., Hansen, P., « Distance spectra of graphs: A survey », Linear Algebra and its Applications, 458, 301-386, octobre 2014.
  13. Belhaiza, S., Audet, C., Hansen, P., « A note on bimatrix game maximal Selten subsets », Arabian Journal of Mathematics,3(3), 299-311, septembre 2014.
  14. Aouchiche, M., Hansen, P., « Some Properties of the Distance Laplacian Eigenvalues of a Graph », Czechoslovak Mathematical Journal, 63(3), 751-761, septembre 2014.
  15. Carbonneau, R.A., Caporossi, G., Hansen, P., « Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization », Journal of Classification, 31(2), 219-241, juillet 2014.
  16. Cafieri, S., Hansen, P., Mladenovic, N., « Edge-ratio network clustering by Variable Neighborhood Search ». The European Physical Journal B, 87(5), 1-7, mai 2014.
  17. Fernandes, I., Aloise, D., Aloise, D.J., Hansen, P., Liberti, L., « On the Weber facility location problem with limited distances and side constraints », Optimization Letters, 8(2), 407-424, février 2014.
  18. Cafieri, S., Hansen, P., Liberti, L., « Improving heuristics for network modularity maximization using an exact algorithm », Discrete Applied Mathematics, 163, Part 1 65-72, janvier 2014.
  19. Costa, A., Hansen, P., « A Locally Optimal Hierarchical Divisive Heuristic for bipartite Modularity Maximization », Optimization Letters, 8(3), 903-917, mars 2014.
  20. Desrosiers, C., Galinier, P., Hansen, P., Hertz, A., « Automated generation of conjectures on forbidden subgraph characterization ». Discrete Applied Mathematics, 162, 177-194, 2014.
  21. Doerner, K.F., Hansen, P., Maniezzo, V., Voss, S., « Editorial, Matheuristics 2010 », Discrete Applied Mathematics, 163, 1-2, janvier 2014.
  22. Aouchiche, M., Caporossi, G., Hansen, P., « Refutations, Results and Conjectures about the Balaban Index », International Journal of Chemical Modeling. 5, 189-202, 2013.
  23. Brimberg, J., Mladenovic, N., Hansen, P., « Sequential clustering with radius and split criteria », Central European Journal of Operations Research, 21(1 Supplement), 95-115, 2013.
  24. Aouchiche, M., Caporossi, G., Hansen, P., « Open problems on graph eigenvalues studied with AutoGraphiX », EURO Journal on Computational Optimization, 1(1), 181-199, 2013.
  25. Aouchiche, M., Hansen, P., « Two Laplacians for the distance matrix of a graph », Linear Algebra Appl., 439(1), 21-33, 2013.
  26. Aouchiche, M., Caporossi, G., Hansen, P., « Refutations, Results and Conjectures about the Balaban Index », International Journal of Chemical Modeling, 5, 189-202, 2013
  27. Audet, C., Hansen, P., Messine, F., « Ninin, J., The small octagons of maximal width », Discrete & Computational Geometry, 49(3), 589-600, 2013.
  28. Aouchiche, M., Hansen, P., « A survey of Nordhaus-Gaddum type relations », Discrete Applied Mathematics, 161(4-5), 466-546, 2013.
  29. Costa, A., Hansen, P., Liberti, L., « On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square », Discrete Applied Mathematics, 161(1-2), 96-106, 2013.
  30. Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., Ruiz, M., « Modularity maximization in networks by Variable Neighbourhood Search », Graph Partitioning and Graph Clustering , 588, 113-127, 2013.
  31. Hansen, P., Ruiz, M., Aloise, D., « A VNS heuristic for escaping local extrema entrapment in normalized cut clustering », Pattern Recognition, 45(12), 4337-4345, December 2012.
  32. Carbonneau, R.A., Caporossi, G., Hansen, P., « Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression », Computers & Operations Research, 39(11), 2748-2762, 2012
  33. Bettinelli, A., Hansen, P., Liberti, L., « Algorithm for parametric community detection in networks », Physical Review E, 86, 016107,11 pages, 2012.
  34. Cafieri, S., Caporossi, G., Hansen, P., Perron, S., Costa, A., « Finding communities in networks in the strong and almost-strong sense », Physical Review E, 85(4), article no. 046113, 2012.
  35. Cafieri, S., Hansen, P., Létocart, L., Liberti, L., « Compact relaxations for polynomial programming problems », Experimental Algorithms, Lecture Notes in Computer Science, 7276, 75-86, 2012.
  36. Belhaiza, S., Audet, C., Hansen, P., « On Proper Refinement of Nash Equilibria for Bimatrix Games », Automatica, 48(2), 297-303, 2012.
  37. Aloise, D., Hansen, P., Liberti, L., « An Improved Column Generation Algorithm for Minimum Sum-of-Squares Clustering », Mathematical Programming, 131(1-2), 195-220, 2012.
  38. Aouchiche, M., Hansen, P., « The Normalized Revised Szeged Index », MATCH-Communications in Mathematical and in Computer Chemistry, 67(2), 369-381, 2012.
  39. Noble, S.D., Hansen, P., Mladenovic, N., « Maximizing Edge-Ratio is NP-Complete », Discrete Applied Mathematics, 159(18), 2276-2280, 2011.
  40. Aouchiche, M., Hansen, P., Lucas, C., « On the extremal values of the second largest Q-eigenvalue », Linear Algebra and its Applications, 435(10), 2591-2606, 2011.
  41. Costa, A., Hansen, P., « Comment on Evolutionary method for finding communities in bipartite networks », Physical Review E, 84(5), article no. 058101, 2011.
  42. Aouchiche, M., Hansen, P., « Proximity and Remoteness in Graphs: Results and Conjectures », Networks, 58(2), 95-102, 2011.
  43. Boros, E., Crama, Y., De Werra, D., Hansen, P., Maffray, F., « The Mathematics of Peter L. Hammer (1936-2006): Graphs, optimization, and Boolean models », Annals of Operations Research, 188(1), 1-18, 2011.
  44. Hansen, P., Meyer, C., « A new column generation algorithm for Logical Analysis of Data », Annals of Operations Research, 188(1), 215-249, 2011.
  45. Sedlar, J., Vukicevic, D., Hansen, P., « Using Size for Bounding Expressions of Graph Invariants », Annals of Operations Research, 188(1), 415-427, 2011.
  46. Carbonneau, R.A., Caporossi, G., Hansen, P., « Globally optimal clusterwise regression by mixed logicalquadratic programming », European Journal of Operation Research, 212(1), 213-222, 2011.
  47. Desrosiers, C., Galinier, Ph., Hansen, P., Hertz, A., « Improving constrained pattern mining with firstfail-based heuristics », Data Mining and Knowledge Discovery, 23(1), 63-90, 2011.
  48. Audet, C., Hansen, P., Perron, S., « Remarks on solutions to a nonconvex quadratic programming test problem », Journal of Global Optimization, 50(2), 363-369, 2011.
  49. Alguwaizani, A., Hansen, P., Mladenovic, N., Ngai, E., « Variable Neighborhood Search for Harmonic Means Clustering », Applied Mathematical Modelling, 35(6), 2688-2694, 2011.
  50. Cafieri, S., Hansen, P., Liberti, L., « Locally optimal heuristic for modularity maximization of networks », Physical Review E, 83(5), article no. 056105, 2011.
  51. Audet, C., Guillou, A., Hansen, P., Messine, F., Perron, S., « The Small Hexagon and Heptagon with Maximum Sum of Distances Between Vertices », Journal of Global Optimization, 49(3), 467-480, 2011. Aloise, D., Hansen, P., « Evaluating a Branch-and-Bound RLT-Based Algorithm for Minimum Sum-of-Squares Clustering », Journal of Global Optimization, 49(3), 449-465, 2011.
  52. Desrosiers, C., Galinier, P., Hertz, A., Hansen, P., « Improving constrained pattern mining with first-fail-based heuristics », Data mining and knowledge discovery, 23(1), 63-90, 2011.
  53. Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Liberti. , Perron, S., « Column generation algorithms for exact modularity maximization in networks », Physical Review E., 82(4), article no. 046112, 9 pages, 2010.
  54. Cafieri, S., Hansen, P., Liberti. , « Loops and Multiple Edges in Modularity Maximization of Networks », Physical Review E., 81(4), 046102, 9 pages, 2010.
  55. Cafieri, S., Hansen, P., Liberti. , « Edge Ratio and Community Structure in Networks », Physical Review E., 81(2), 026105, 14 pages, 2010.
  56. Hansen, P., Lucas, C., « Bounds and Conjectures for the Signless Laplacian Index of Graphs », Linear algebra and its applications, 432(12), 3319–3336, 2010.
  57. Aouchiche, M., Hansen, P., Stevanović, D., « A Sharp Upper Bound on Algebraic Connectivity Using Domination Number », Linear algebra and its applications, 432(11), 2879–2893, 2010.
  58. Aouchiche, M., Hansen, P., « On a Conjecture About the Szeged Index », European Journal of Combinatorics, 31(7), 1662–1666, 2010.
  59. Caporossi, G., Hansen, P., Vukicevic, D., « Comparing Zagreb Indices of Cyclic Graphs », MATCH, 63(2), 441–451, 2010.
  60. Aouchiche, M., Hansen, P., « Nordhaus-Gaddum Relations for Proximity and Remoteness in Graphs », Computers & Mathematics with Applications, 59(8), 2827–2835, 2010.
  61. Aouchiche, M., Hansen, P., « A Survey of Automated Conjectures in Spectral Graph Theory », Linear Algebra and Applications, 432(9), 2293–2322, 2010.
  62. Sedlar, J., Vukicević, D., Aouchiche, M., Hansen, P., « Variable Neighborhood Search for Extremal Graphs. 24. Conjectures and Results About the Clique Number », Studia Informatica Universalis, 8(2), 281–316, 2010.
  63. Brimberg, J, Hansen, P., Mladenović, N., « Attraction Probabilities in Variable Neighborhood Search », 4OR, 8(2), 181–194, 2010.
  64. Hansen, P., Mladenović, N., Perez, J., « Variable Neighbourhood Search: Methods and Applications », Annals of Operational Research, 175(1), 367–407, 2010.
  65. Perron, S., Hansen, P., Le Digabel, S., Mladenović, n., « Exact and Heuristic Solutions of the Global Supply Chain Problem with Transfer Pricing », European Journal of Operational Research, 202(3), 864–879, 2010.
  66. Audet, C., Fournier, X., Hansen, P., Messine, F., « A Note on Diameters of Point Sets », Optimization Letters, 4(4), 585–595, 2010.
  67. Audet, C., Belhaiza, S., Hansen, P., « A New Sequence Form Approach for the Enumeration and Refinement of all Extreme Nash Equilibria For Extensive Form Games », International Game Theory Review, 4, 437–451, 2009.
  68. Audet, C., Hansen, P., Messine, F., « La saga des trois petits octogones »,Pour la science, 380, 62–68, 2009.
  69. Aouchiche, M., Favaron, O., Hansen, P., « Variable Neighborhood Search for Extremal Graphs. 22. Extending Bounds for Independence to Upper Irredundance », Discrete Applied Mathematics, 157(17), 3497–3510, 2009.
  70. Oliveira, C.S., Lima, L.S., Abreu, N.M.M., Hansen, P., « Bounds on the Index of the Signless Laplacian of a Graph », Discrete Applied Mathematics, 158(4), 355–360, 2010.
  71. Hansen, P., Maniezzo, V., Voss, S., « Special issue on mathematical contributions to metaheuristics editorial », Journal of Heuristics, 15(3), 197–199, 2009.
  72. Aouchiche, M., Favaron, O., Hansen, P., « Recherche à voisinage variable de graphes extrémaux. 26. Nouveaux résultats sur la maille », RAIRO Operations Research, 43(4), 339– 358, 2009.
  73. Hansen, P., Brimberg, J., Urosević, D., Mladenović, n., « Solving Largep-Median Clustering Problems by Primal-Dual Variable Neighborhood Search », Data Mining and Knowledge Discovery, 19(3), 351–375, 2009.
  74. Blanquero, R., Carrizosa, E., Hansen, P., « Locating Objects in the Plane using Global Optimization Techniques », Mathematics of Operations Research, 34(4), 837–879, 2009.
  75. Hansen, P., Lucas, C., « An Inequality for the Signless Laplacian Index of a Graph Using the Chromatic Number », Graph Theory Notes of New-York, LVII, 39–42, 2009.
  76. Aloise, D., Hansen, P., « A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of- Squares Clustering », Pesquisa Operacional, 29, 503–516, 2009.
  77. Zhao, Q.H., Urosević, D., Mladenović, N., Hansen, P.,, « A note on Restarted and Modified Simplex Search for Unconstrained Optimization », Computers & Operations Research, 36(12), 3263–3271, 2009.
  78. Hansen, P., Vukicević, D., « Variable Neighborhood Search for Extremal Graphs. 23. On the Randic Index and the Chromatic Number », Discrete Mathematics, 309(13) 4228–4234, 2009.
  79. Hansen, P., Meyer, C., « Improved Compact Linearizations for the Unconstrained Quadratic 0-1 Minimization Problem », Discrete Applied Mathematics, 157(6), 1267–1290, 2009.
  80. Aouchiche, M., Hansen, P., « Bounding Average Distance Using Order and Minimum Degree », Graph Theory Notes of New York, LVI, 21–29, 2009.
  81. Aouchiche, M., Hansen, P., Stevanović, D., « Variable Neighborhood Search for Extremal Graphs. 17. Further Conjectures and Results about the Index », Discussiones Mathematicae: Graph Theory, 29, 15–37, 2009.
  82. Audet, C., Hansen, P., Messine, F., « Extremal Problems for Convex Polygons – An Update », Fields Institute Communications, 56, 1–16, 2009.
  83. Hansen, P., Labbé, M., Schindl, D., « Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results », Discrete Optimization, 6(2), 135–147, 2009.
  84. Aloise, D., Deshpande, A., Hansen, P., Popat, P., « NP-hardness of Euclidean sum-ofsquares clustering », Machine Learning, 75(2), 245–248, 2009.
  85. Audet, C., Hansen, P., Messine, F., « Simple Polygons of Maximum Perimeter Contained in a Unit Disk », Discrete and Computational Geometry, 41(2), 208–215, 2009.
  86. Audet, C., Hansen, P., Messine, F., « Isoperimetric Polygons of Maximal Width », Discrete and Computational Geometry, 41(1), 45–60, 2009.
  87. Hansen, P., Hertz, A., Kilani, R., Marcotte, O., Schindl, D., « Average Distance and Maximum Induced Forest », Journal of Graph Theory, 60(1), 31–54, 2009.
  88. Sedlar, J., Vukicević, D., Aouchiche, M., Hansen, P., « Variable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures », Graph Theory Notes of New York, LV, 6–13, 2008.
  89. Hansen, P., Mladenović, N., Moreno Pérez, J.A., « Variable Neighborhood Search: Methods and Applications », 4OR, 6(4), 319–360, 2008.
  90. Brimberg, J., Hansen, P., Mladenović, N., Salhi, S., « A Survey of Solution Methods for the Continuous Location–Allocation Problem », International Journal of Operations Research, 5(1), 1–12, 2008.
  91. Audet, C., Hansen, P., Messine, F., « Ranking Small Regular Polygons by Area and by Perimeter », Journal of Applied and Industrial Mathematics, 3(1), 21–27, 2009. Published at first in russian in Diskretnyi Analiz i Issledovanie Operatsii, 15(3), 65–73, 2008.
  92. Audet, C., Hansen, P., Karam, A., Ng, C.T., Perron, S., « Exact Solution ofL2-norm Plane Separation », Optimization Letters, 2(4), 483-495, 2008.
  93. Aouchiche, M., Bell, F.K., Cvetković, D., Hansen, P., Rowlinson, P., Simić, S., Stevanovic, D., « 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.
  94. Hansen, P., Mladenović, N., Moreno Pérez, J.A., « Variable Neighborhood Search », European European Journal of Operational Research, 191(3), 593-595, 2008.
  95. Hansen,P., Stevanović, D., « On Bags and Bugs », Discrete Applied Mathematics, 156(7), 986-997, 2008.
  96. Hansen, P., Mladenović, N., Ogüz, C., « Variable Neighborhood Search for Minimum Cost Berth Allocation », European Journal of Operational Research, 191(3), 636–649, 2008.
  97. Stevanović, D., Aouchiche, M., Hansen, P., « On the Spectral Radius of Graphs with a Given Domination Number », Linear Algebra and its Applications, 428(2008), 1954-1864, 2008.
  98. Brimberg, J.,Hansen,P., Laporte, G., Mladenović, N., Urosević, D., « The maximum return-on-investment plant location problem with market share », Journal of the Operational Research Society, 59(3), 399–406, 2008.
  99. Stevanović, D., Hansen, P., « The Minimum Spectral Radius of Graphs with a Given Clique Number », Electronic Journal of Combinatorics, 17, 110-117, 2008.
  100. Hansen, P., Mladenović, N., « Complement to a comparative analysis of heuristics for the p-median problem », Statistics and Computing, 18(1), 41-46, 2008.
  101. Hansen, P., Perron, S., « Merging the Local and Global Approaches to Probabilistic Satisfiability », International Journal of Approximate Reasoning, 47(2), 125-140, 2008.
  102. Hansen, P., Perron, S., « Algorithms forl1-Embeddability and Related Problems », Journal of Classification, 24(2), 251-275, 2007.
  103. Hansen, P., Brimberg, J, Mladenović, N., Urosević, D., « Primal-Dual Variable Neighborhood Search for the Simple Plant Location Problem » ,INFORMS Journal on Computing, 19(4), 552-564, 2007.
  104. Aouchiche, M., Caporossi, G., Hansen, P., « Variable Neighborhood Search for Extremal Graphs. Automated Comparison of Graph Invariants », MATCH58(2), 365-384, 2007.
  105. Aouchiche, M., Hansen, P., Zheng, M., « Variable Neighborhood Search for Extremal Graphs. Further Conjectures and Results about the Randic Index », MATCH 58(1), 83-102, 2007.
  106. Mladenović, N., Brimberg, J., Hansen,P., Moreno-Pérez, J. A., « The p-median problem: A survey of metaheuristic approaches », European Journal of Operational Research, 179(3), 927-939, 2007.
  107. Hansen, P., Vukicević, D., « Comparing the Zagreb Indices »,Croatica Chemica Acta 80(2),165-168, 2007.
  108. Audet, C., Hansen, P. Messine F., « Extremal Problems for Convex Polygons », Journal of Global Optimization, 38(2), 163-179, 2007.
  109. Van Omme, N., Hansen,P., « On Pitfalls in Computing the Geodetic Number of a Graph », Optimization Letters, 1(3), 299-307, 2007.
  110. Caporossi, G., Hansen, P., Karam, A., « Arbitrary-Norm Hyperplane Separation by Variable Neighborhood Search », IMA Journal of Management Mathematics, 18(2), 173-189, 2007.
  111. Hansen, P., Lazić, J., Mladenović, N., « Variable Neighbourhood Search for Colour Image Quantization »,IMA Journal of Management Mathematics18(2), 207-221, 2007.
  112. Hansen,P., Lagouanelle, J.-L., Messine, F., « Comparaison Between Baumann and Admissible Simplex Forms in Interval Analysis », Journal of Global Optimization, 37(2), 215-228, 2007.
  113. Audet, C., Hansen,P., Messine, F., « The small octagon with longest perimeter », Journal of Combinatorial Theory, Series A, 114(1), 135-150, 2006.
  114. Aouchiche, M., Hansen, P., « On a conjecture about the Randic index », Discrete Mathematics, 307(2), 262-265, 2007.
  115. Brimberg, J., Hansen,P., Mladenović, N., « Decomposition strategies for large scale continuous location-allocation problems », IMA Journal of Management Mathematics, 17(4), 307-316, 2006.
  116. Audet, C., Belhaiza, S., Hansen,P., « Enumeration of All Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games », Journal of Optimization Theory and Applications, 129(3), 349-372, 2006.
  117. Brankov, V., Hansen, P., Stevanović, D., « Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs », Linear Algebra and its Applications, 414(2-3) 407–424, 2006.
  118. Mladenović, N., Brimberg, J., Hansen, P., « A Note on Duality Gap in the Simple Plant Location Problem », European Journal of Operational Research, 174(1), 11–22, 2006.
  119. Aouchiche, M., Hansen, P., Zheng, M., « Variable Neighborhood Search for Extremal Graphs. Conjectures and Results about the Randic Index », MATCH, 56(3), 541–550, 2006.
  120. Audet C., Hansen P., Messine F., « Quatre Petits Octogones », MATAPLI, 108(1), 63-75, 2006.
  121. Hansen, P., Mladenović, N., « First vs. best improvement: An empirical study », Discrete Applied Mathematics, 154(5), 802–817, 2006.
  122. Hansen, P., Mladenović, N., Urosević, D., « Variable Neighborhood Search and Local Branching », Computers & Operations Research, 33(10), 3034–3045, 2006.
  123. Hansen, P., Ngai, E., Cheung, B.K., Mladenović, N., « Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering », Journal of Classification, 22(2), 287–310, 2005.
  124. Aouchiche, M., Caporossi, G., Hansen, P., Laffay, M., « AutoGraphiX: a survey », Electronic Notes in Discrete Mathematics, 22, 515–520, 2005.
  125. Aouchiche, M., Hansen, P., « Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille », Rairo-Operations Research, 39(4), 275–293, 2005.
  126. Davidović, T., Hansen, P., Mladenović, N., « Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays », Asia-Pacific Journal of Operational Research, 22(3), 297–326, 2005.
  127. Hansen, P., Stevanović, D., « On Bags and Bugs », Electronic Notes in Discrete Mathematics, 19(1), 111–116, 2005.
  128. Dominguez-Marín, P., Nickel, S., Hansen, P., Mladenović, N., « Heuristics Procedures for Solving the Discrete Ordered Median Problem », Annals of Operations Research, 136(1), 145–173, 2005.
  129. Dell’olmo, P., Hansen, P., Pallottino, S., Storchi, G., « On uniform k-partition problems », Discrete Applied Mathematics, 150(1–3), 121–139, 2005.
  130. Gutman, I., Hansen, P., Mélot, M., « Variable Neighborhood Search for Extremal Graphs 10. Comparison of Irregularity Indices for Chemical Thees », Journal of Chemical Information and Modeling, 45 (2005) 222–230.
  131. De Werra, D., Hansen, P., « Variations on the Roy-Gallai theorem », 4OR, 3(3), 243–251, 2005.
  132. Hansen, P., Mélot, H., Gutman, I., « Variable Neighborhood Search for Extremal Graphs 12. A Note on the Variance of Bounded Degrees in Graphs », MATCH, Communications in Mathematical and Computer Chemistry, 54(1), 221–232, 2005.
  133. Ruiz, J.P., Chebat, J.C., Hansen, P., « Another Trip to the Mall: A Segmentation Study of Customers Based on their Activities », Journal of Retailing and Consumer Services, 11 (2004) 333–350.
  134. Audet, C. Hansen, P., Messine, F., Perron, S., « The Minimum Diameter Octagon with Unit-Length Sides: Vincze’s Wife’s Octagon is Suboptimal », Journal of Combinatorial Theory A, 108 (2004) 63–75.
  135. Nau, R., Canovas, S.G., Hansen, P., « On the Geometry of Nash Equilibria and Correlated Equilibria », International Journal of Game Theory, 32 (2004) 443–453.
  136. Cvetković, D., Hansen, P., Kovacević-Vujcić, V., « On Some Interconnections Between Combinatorial Optimization and Extremal Graph Theory », YUJOR-Yugoslav Journal of Operations Research, 14 (2004) 147–159.
  137. Audet, C. Carrizosa, E., Hansen, P., « An Exact Method for Fractional Goal Programming », Journal of Global Optimization, 29 (2004) 113–120.
  138. Crainic, T., Gendreau, M., Hansen, P., Mladenović, N., « Cooperative Parallel Variable Neighborhood Search for the p-Median », Journal of Heuristics, 10 (3), 293–314, 2004.
  139. Hansen, P., Mladenović, N., Urosević, D., « Variable Neighborhood Search for the Maximum Clique », Discrete Applied Mathematics, 145(1), 117–125, 2004.
  140. Audet, C. Brimberg, J., Hansen, P., Le Digabel, S., Mladenović, N., « Pooling Problem: Alternate Formulations and Solution Methods », Management Science, 50 (2004) 761–776.
  141. Carrizosa, E., Hansen, P., Messine, F., « Improving Bounds for Interval Analysis by Translation », Journal of Global Optimization, 29 (2004) 157–172.
  142. Caporossi, G., Hansen, P., « Variable Neighborhood Search for Extremal Graphs. Three Ways to Automate Finding Conjectures », Discrete Mathematics, 276 (2004) 81–94
  1. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S., « Variable neighborhood search: basics and variants », EURO Journal on Computational Optimization, 2016.
  2. Aouchiche, M., Hansen, P., « Distance Laplacian eigenvalues and chromatic number in graphs », Filomat, 2017.