PUBLICATIONS

Livres

  1. Pardalos, P.M., Hansen, P. (eds.), Data Mining and Mathematical Programming, CRM Proceedings and Lecture Notes, Vol. 45, American Mathematical Society, Providence, RI, 2008.

  2. Audet, C. Hansen, P., Savard, G. (eds.), "Essays and Surveys in Global Optimization", Kluwer, Dordrecht, 2005.

  3. Fajtlowicz, S., Fowler, P., Janowitz, M., Hansen, P., Roberts, F.S. (eds.), "Graphs and Discovery", AMS, Providence, RI, 2005.

Chapitre de livres

  1. Aloise, D., Hansen, P., "Clustering", in Handbook of Discrete and Combinatorial Optimization, 2009 (à paraître).

  2. Hansen, P., Mladenović, N., "Variable Neighborhood Search Methods", in Handbook of Applied Optimization (2nd edition), C. Floudas, P. Pardalos (eds.), 3978-3989, 2009.

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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

Articles publiés

  1. Desrosiers, C., Galinier, P., Hertz, A., Hansen, P., "Improving constrained pattern mining with first-fail-based heuristics", Data mining and knowledge discovery, DOI: 10.1007/s 10618-010-0199-1, 2010.

  2. Cafieri, S., Hansen, P., Liberti. L., "Column generation algorithms for exact modularity maximization in networks", Physical Review E., 82(4), 046112, 9 pages, 2010.

  3. Cafieri, S., Hansen, P., Liberti. L., "Loops and Multiple Edges in Modularity Maximization of Networks", Physical Review E., 81(4), 046102, 9 pages, 2010.

  4. Cafieri, S., Hansen, P., Liberti. L., "Edge Ratio and Community Structure in Networks", Physical Review E., 81(2), 026105, 14 pages, 2010.

  5. Hansen, P., Lucas, C., "Bounds and Conjectures for the Signless Laplacian Index of Graphs", Linear algebra and its applications, 432(12), 3319–3336, 2010.

  6. 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.

  7. Aouchiche, M., Hansen, P., "On a Conjecture About the Szeged Index", European Journal of Combinatorics, 31(7), 1662–1666, 2010.

  8. Caporossi, G., Hansen, P., Vukicevic, D., "Comparing Zagreb Indices of Cyclic Graphs", MATCH, 63(2), 441–451, 2010.

  9. Aouchiche, M., Hansen, P., "Nordhaus-Gaddum Relations for Proximity and Remoteness in Graphs", Computers & Mathematics with Applications, 59(8), 2827–2835, 2010.

  10. Aouchiche, M., Hansen, P., "A Survey of Automated Conjectures in Spectral Graph Theory", Linear Algebra and Applications, 432(9), 2293–2322, 2010.

  11. 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.

  12. Brimberg, J, Hansen, P., Mladenović, N., "Attraction Probabilities in Variable Neighborhood Search", 4OR, 8(2), 181–194, 2010.

  13. Hansen, P., Mladenović, N., Perez, J., "Variable Neighbourhood Search: Methods and Applications", Annals of Operational Research, 175(1), 367–407, 2010.

  14. 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.

  15. Audet, C., Fournier, X., Hansen, P., Messine, F., "A Note on Diameters of Point Sets", Optimization Letters, 4(4), 585–595, 2010.

  16. 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.

  17. Audet, C., Hansen, P., Messine, F., "La saga des trois petits octogones", Pour la science, 380, 62–68, 2009.

  18. 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.

  19. 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.

  20. Hansen, P., Maniezzo, V., Voss, S., "Special issue on mathematical contributions to metaheuristics editorial", Journal of Heuristics, 15(3), 197–199, 2009.

  21. 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.

  22. Hansen, P., Brimberg, J., Urosević, D., Mladenović, n., "Solving Large p-Median Clustering Problems by Primal-Dual Variable Neighborhood Search", Data Mining and Knowledge Discovery, 19(3), 351–375, 2009.

  23. Blanquero, R., Carrizosa, E., Hansen, P., "Locating Objects in the Plane using Global Optimization Techniques", Mathematics of Operations Research, 34(4), 837–879, 2009.

  24. 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.

  25. Aloise, D., Hansen, P., "A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of- Squares Clustering", Pesquisa Operacional, 29, 503–516, 2009.

  26. 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.

  27. 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.

  28. Hansen, P., Meyer, C., "Improved Compact Linearizations for the Unconstrained Quadratic 0-1 Minimization Problem", Discrete Applied Mathematics, 157(6), 1267–1290, 2009.

  29. Aouchiche, M., Hansen, P., "Bounding Average Distance Using Order and Minimum Degree", Graph Theory Notes of New York, LVI, 21–29, 2009.

  30. 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.

  31. Audet, C., Hansen, P., Messine, F., "Extremal Problems for Convex Polygons - An Update", Fields Institute Communications, 56, 1–16, 2009.

  32. 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.

  33. Aloise, D., Deshpande, A., Hansen, P., Popat, P., "NP-hardness of Euclidean sum-ofsquares clustering", Machine Learning, 75(2), 245–248, 2009.

  34. 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.

  35. Audet, C., Hansen, P., Messine, F., "Isoperimetric Polygons of Maximal Width", Discrete and Computational Geometry, 41(1), 45–60, 2009.

  36. 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.

  37. 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.

  38. Hansen, P., Mladenović, N., Moreno Pérez, J.A., "Variable Neighborhood Search: Methods and Applications", 4OR, 6(4), 319–360, 2008.

  39. 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.

  40. 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.Parue au préalable en version Russe dans Diskretnyi Analiz i Issledovanie Operatsii, 15(3), 65–73, 2008.

  41. Audet, C., Hansen, P., Karam, A., Ng, C.T., Perron, S., "Exact Solution of L2-norm Plane Separation", Optimization Letters, 2(4), 483-495, 2008.

  42. 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.

  43. Hansen, P., Mladenović, N., Moreno Pérez, J.A., "Variable Neighborhood Search", European European Journal of Operational Research, 191(3), 593-595, 2008.

  44. Hansen,P., Stevanović, D., "On Bags and Bugs", Discrete Applied Mathematics, 156(7), 986-997, 2008.

  45. 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.

  46. 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.

  47. 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.

  48. Stevanović, D., Hansen, P., "The Minimum Spectral Radius of Graphs with a Given Clique Number", Electronic Journal of Combinatorics, 17, 110-117, 2008.

  49. Hansen, P., Mladenović, N., "Complement to a comparative analysis of heuristics for the p-median problem", Statistics and Computing, 18(1), 41-46, 2008.

  50. Hansen, P., Perron, S., "Merging the Local and Global Approaches to Probabilistic Satisfiability", International Journal of Approximate Reasoning, 47(2), 125-140, 2008.

  51. Hansen, P., Perron, S., "Algorithms for l1-Embeddability and Related Problems", Journal of Classification, 24(2), 251-275, 2007.

  52. 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.

  53. Aouchiche, M., Caporossi, G., Hansen, P., "Variable Neighborhood Search for Extremal Graphs. 20. Automated Comparison of Graph Invariants", MATCH 58(2), 365-384, 2007.

  54. Aouchiche, M., Hansen, P., Zheng, M.,"Variable Neighborhood Search for Extremal Graphs. 19. Further Conjectures and Results about the Randic Index", MATCH 58(1), 83-102, 2007.

  55. 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.

  56. Hansen, P., Vukicević, D., "Comparing the Zagreb Indices", Croatica Chemica Acta 80(2),165-168, 2007.

  57. Audet, C., Hansen, P. Messine F., "Extremal Problems for Convex Polygons", Journal of Global Optimization, 38(2), 163-179, 2007.

  58. Van Omme, N., Hansen,P., "On Pitfalls in Computing the Geodetic Number of a Graph", Optimization Letters, 1(3), 299-307, 2007.

  59. Caporossi, G., Hansen, P., Karam, A., "Arbitrary-Norm Hyperplane Separation by Variable Neighborhood Search", IMA Journal of Management Mathematics 18(2), 173-189, 2007.

  60. Hansen, P., Lazić, J., Mladenović, N.,"Variable Neighbourhood Search for Colour Image Quantization", IMA Journal of Management Mathematics 18(2), 207-221, 2007.

  61. 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.

  62. Audet, C., Hansen,P., Messine, F., "The small octagon with longest perimeter", Journal of Combinatorial Theory, Series A, 114(1), 135-150, 2006.

  63. Aouchiche, M., Hansen, P., "On a conjecture about the Randic index", Discrete Mathematics, 307(2), 262-265, 2007.

  64. 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.

  65. 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.

  66. 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.

  67. 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.

  68. Aouchiche, M., Hansen, P., Zheng, M., "Variable Neighborhood Search for Extremal Graphs. 18. Conjectures and Results about the Randic Index", MATCH 56(3), 541–550, 2006.

  69. Audet C., Hansen P., Messine F., "Quatre Petits Octogones", MATAPLI, 108(1), 63-75, 2006.

  70. Hansen, P., Mladenović, N., "First vs. best improvement: An empirical study", Discrete Applied Mathematics 154(5), 802–817, 2006.

  71. Hansen, P., Mladenović, N., Urosević, D., "Variable Neighborhood Search and Local Branching", Computers & Operations Research 33(10), 3034–3045, 2006.

  72. 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.

  73. Aouchiche, M., Caporossi, G., Hansen, P., Laffay, M., "AutoGraphiX: a survey", Electronic Notes in Discrete Mathematics 22, 515–520, 2005.

  74. Aouchiche, M., Hansen, P., "Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille", Rairo-Operations Research 39(4), 275–293, 2005.

  75. 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.

  76. Hansen, P., Stevanović, D., "On Bags and Bugs", Electronic Notes in Discrete Mathematics 19(1), 111–116, 2005.

  77. 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.

  78. Dell'olmo, P., Hansen, P., Pallottino, S., Storchi, G., "On uniform k-partition problems", Discrete Applied Mathematics, 150(1–3), 121–139, 2005.

  79. 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.

  80. De Werra, D., Hansen, P., "Variations on the Roy-Gallai theorem", 4OR 3(3), 243–251, 2005.

  81. 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.

  82. 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.

  83. 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.

  84. 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.

  85. 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.

  86. Audet, C. Carrizosa, E., Hansen, P., "An Exact Method for Fractional Goal Programming", Journal of Global Optimization 29 (2004) 113–120.

  87. 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.

  88. Hansen, P., Mladenović, N., Urosević, D., "Variable Neighborhood Search for the Maximum Clique", Discrete Applied Mathematics 145(1), 117–125, 2004.

  89. Audet, C. Brimberg, J., Hansen, P., Le Digabel, S., Mladenović, N., "Pooling Problem: Alternate Formulations and Solution Methods", Management Science 50 (2004) 761–776.

  90. Carrizosa, E., Hansen, P., Messine, F., "Improving Bounds for Interval Analysis by Translation", Journal of Global Optimization 29 (2004) 157–172.

  91. Caporossi, G., Hansen, P., "Variable Neighborhood Search for Extremal Graphs. 5. Three Ways to Automate Finding Conjectures", Discrete Mathematics 276 (2004) 81–94.

Articles à paraître

  1. Sedlar, J., Vukicević, D., Hansen, P., "Using Size for Bounding Expressions of Graph Invariants", Annals of Operations Research.

  2. Aouchiche, M., Hansen, P., "Proximity and Remoteness in Graphs: Results and Conjectures", Networks.

  3. Aloise, D., Hansen, P., "Evaluating a Branch-and-Bound RLT-Based Algorithm for Minimum Sum-of-Squares Clustering", Journal of Global Optimization.

  4. Aloise, D., Hansen, P., Liberti, L., "An Improved Column Generation Algorithm for Minimum Sum-of-squares Clustering", Mathematical Programming.

  5. 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.

Articles soumis

  1. Carbonneau, R.A., Caporossi, G., Hansen, P., "Extensions to the repetitive branch and bound algorithm for glocally optimal clusterwise regression".

  2. Carbonneau, R.A., Caporossi, G., Hansen, P., "Globally optimal clusterwise regression by mixed logical-quadratic programming".

  3. Ruiz, E., Aloise, D., Hansen, P., "Variable Neighborhood Search for Normalized Cut".

  4. Hansen, P., Meyer, C., "A New Column Generation Algorithm for Logical Analysis of Data".

  5. Hansen, P., Mladenovicć, N., Brimberg, J., Moreno Pérez, J., "Variable Neighborhood Search".

  6. Alguwaizani, A., Hansen, P., Mladenović, N., Ngai, E., "Variable Neighborhood Search for Harmonic Means Clustering".

  7. Caporossi, G., Hansen, P., "A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm".

  8. Amini, H., Hansen, P., Perron, S., "Mutations of Test Problems for Geometric Programming – A Cautionary Tale".

  9. Bessadok, A., Hansen, P., Rebaï, A., "Variable Neighborhood Search for Finding Parameter Values in Finite Mixture Model".

  10. Desrosiers, C., Galinier, PH., Hansen, P., Hertz, A., "Using Heuristics to Speed Up Frequent Pattern Mining".

  11. Aouchiche, M., Caporossi, G., Hansen, P., "Variable Neighborhood Search for Extremal Graphs. 27. Families of Extremal Graphs".

  12. Audet, C., Belhaiza, S., Hansen, P., "Perfect and Proper Refinements of All Extreme Nash Equilibria for Bimatrix Games".

  13. Desrosiers, C., Galinier, P., Hansen, P., Hertz, A., "Automated Generation of Conjectures on Forbidden Subgraph Characterization".

  14. Desrosiers, C., Galinier, PH., Hansen, P., Hertz, A., "SyGMA: Reducing Symmetry in Graph Mining".

  15. Blanchard, S., Caporossi, G., Hansen, P., "Dynamic Point Selection for the L1 Norm Hyperplane Separation Problem".

  16. Caporossi, G., Hansen, P., "Variable Neighborhood Search for Least Squares Clusterwise Regression".

  17. Karam, A., Hansen, P.,"The Jackknife Revisited: Feature Selection in Linear Programming Approaches to Credit Scoring".

  18. Hansen, P., Jaumard, B., Meyer, C., "Exact Sequential Algorithms for Additive Clustering".

  19. Hansen, P., Krau, S., Peeters, D., Thisse, J.-F., "Weber's Problem with Forbidden Regions for Location and Transportation".

  20. Hansen, P., Jaumard, B., Meyer, C., Tuy, H., "Best Simplicial and Double-Simplicial Bounds for Concave Minimization".

  21. Hansen, P., Jaumard, B., Plateau, G., "An Extension of Nested Satisfiability".

  22. Gourdin, E., Hansen, P., Jaumard, B., "A Strong Heuristic for Maximum Likelihood Estimation of the Three-parameter Weibull Distribution".

  23. Hansen, P., Jaumard, B., Mladenović, N., Parreira, A.D.,"Variable Neighborhood Search for Maximum Weight Satisfiability Problem".

  24. Hansen, P., Jaumard, B., Meyer, C., "A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming".

 

Dernière mise à jour: 14 février 2011
Chaire d'exploitation des données
© HEC Montréal, 2007. Tous droits réservés.
 HEC Montréal