Pierre Hansen

Publication Activity (10 Years)

Years Active: 1976-2022
Publications (10 Years): 19

Top Venues

Discret. Appl. Math.

J. Glob. Optim.

Comput. Oper. Res.

Optim. Lett.

Publications

Omar Foutlane, Issmail El Hallaoui, Pierre Hansen
Distributed Integral Column Generation for Set Partitioning Problems. Oper. Res. Forum 3 (2) (2022)
Sonia Cafieri, Pierre Hansen, Frédéric Messine
Global exact optimization for covering a rectangle with 6 circles. J. Glob. Optim. 83 (1) (2022)
Seyed Ahmad Mojallal, Pierre Hansen
A relation between proximity and the third largest distance eigenvalue of a graph. Discret. Appl. Math. 293 (2021)
Charles Audet, Pierre Hansen, Dragutin Svrtan
Using symbolic calculations to determine largest small polygons. J. Glob. Optim. 81 (1) (2021)
Omar Foutlane, Issmail El Hallaoui, Pierre Hansen
Integral simplex using double decomposition for set partitioning problems. Comput. Oper. Res. 111 (2019)
Rodrigo Randel, Daniel Aloise, Nenad Mladenovic, Pierre Hansen
On the k-Medoids Model for Semi-supervised Clustering. ICVNS (2018)
Kinkar Chandra Das, Mustapha Aouchiche, Pierre Hansen
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs. Discret. Appl. Math. 243 (2018)
Mustapha Aouchiche, Pierre Hansen
Cospectrality of graphs with respect to distance matrices. Appl. Math. Comput. 325 (2018)
Mustapha Aouchiche, Pierre Hansen
Proximity, remoteness and girth in graphs. Discret. Appl. Math. 222 (2017)
Souhir Elleuch, Pierre Hansen, Bassem Jarboui, Nenad Mladenovic
New VNP for automatic programming. Electron. Notes Discret. Math. 58 (2017)
Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5 (3) (2017)
Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24 (3) (2017)
Mustapha Aouchiche, Pierre Hansen
On the nullity number of graphs. Electron. J. Graph Theory Appl. 5 (2) (2017)
Mustapha Aouchiche, Pierre Hansen
The geometric-arithmetic index and the chromatic number of connected graphs. Discret. Appl. Math. 232 (2017)
Mustapha Aouchiche, Pierre Hansen
Proximity, remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 213 (2016)
Jordan Ninin, Frédéric Messine, Pierre Hansen
A reliable affine relaxation method for global optimization. 4OR 13 (3) (2015)
Emilio Carrizosa, Abdulrahman Alguwaizani, Pierre Hansen, Nenad Mladenovic
New heuristic for harmonic means clustering. J. Glob. Optim. 63 (3) (2015)
Sonia Cafieri, Alberto Costa, Pierre Hansen
Adding cohesion constraints to models for modularity maximization in networks. J. Complex Networks 3 (3) (2015)
Andrea Bettinelli, Pierre Hansen, Leo Liberti
Community detection with the weighted parsimony criterion. J. Syst. Sci. Complex. 28 (3) (2015)
Sonia Cafieri, Alberto Costa, Pierre Hansen
Reformulation of a model for hierarchical divisive graph modularity maximization. Ann. Oper. Res. 222 (1) (2014)
Alberto Costa, Pierre Hansen
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization. Optim. Lett. 8 (3) (2014)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Automated generation of conjectures on forbidden subgraph characterization. Discret. Appl. Math. 162 (2014)
Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen, Leo Liberti
On the Weber facility location problem with limited distances and side constraints. Optim. Lett. 8 (2) (2014)
Karl F. Doerner, Pierre Hansen, Vittorio Maniezzo, Stefan Voß
Editorial. Discret. Appl. Math. 163 (2014)
Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha, Éverton Santi
Column generation bounds for numerical microaggregation. J. Glob. Optim. 60 (2) (2014)
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization. J. Classif. 31 (2) (2014)
Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha
Global optimization workshop 2012. J. Glob. Optim. 60 (2) (2014)
Slim Belhaiza, Pierre Hansen, Gilbert Laporte
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52 (2014)
Sonia Cafieri, Pierre Hansen, Leo Liberti
Improving heuristics for network modularity maximization using an exact algorithm. Discret. Appl. Math. 163 (2014)
Behnaz Saboonchi, Pierre Hansen, Sylvain Perron
MaxMinMin p-dispersion problem: A variable neighborhood search approach. Comput. Oper. Res. 52 (2014)
Mustapha Aouchiche, Pierre Hansen
A survey of Nordhaus-Gaddum type relations. Discret. Appl. Math. 161 (4-5) (2013)
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin
The Small Octagons of Maximal Width. Discret. Comput. Geom. 49 (3) (2013)
Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen
Open problems on graph eigenvalues studied with AutoGraphiX. EURO J. Comput. Optim. 1 (1-2) (2013)
Alberto Costa, Pierre Hansen, Leo Liberti
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. Discret. Appl. Math. 161 (1-2) (2013)
Nenad Mladenovic, Pierre Hansen, Jack Brimberg
Sequential clustering with radius and split criteria. Central Eur. J. Oper. Res. 21 (Supplement-1) (2013)
Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz
Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering (2012)
Pierre Hansen, Manuel Ruiz, Daniel Aloise
A VNS heuristic for escaping local extrema entrapment in normalized cut clustering. Pattern Recognit. 45 (12) (2012)
Daniel Aloise, Pierre Hansen, Leo Liberti
An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131 (1-2) (2012)
Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine
Compact Relaxations for Polynomial Programming Problems. SEA (2012)
Gilles Caporossi, Pierre Hansen
A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm. LION (2012)
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression. Comput. Oper. Res. 39 (11) (2012)
Slim Belhaiza, Charles Audet, Pierre Hansen
On proper refinement of Nash equilibria for bimatrix games. Autom. 48 (2) (2012)
Mustapha Aouchiche, Pierre Hansen
Proximity and remoteness in graphs: Results and conjectures. Networks 58 (2) (2011)
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
Globally optimal clusterwise regression by mixed logical-quadratic programming. Eur. J. Oper. Res. 212 (1) (2011)
Fabio Roda, Pierre Hansen, Leo Liberti
The price of equity in the Hazmat. CTW (2011)
Alberto Costa, Pierre Hansen, Leo Liberti
Bound constraints for Point Packing in a Square. CTW (2011)
Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. Ann. Oper. Res. 188 (1) (2011)
Daniel Aloise, Pierre Hansen
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. J. Glob. Optim. 49 (3) (2011)
Jelena Sedlar, Damir Vukicevic, Pierre Hansen
Using size for bounding expressions of graph invariants. Ann. Oper. Res. 188 (1) (2011)
Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen
Improving constrained pattern mining with first-fail-based heuristics. Data Min. Knowl. Discov. 23 (1) (2011)
Charles Audet, Pierre Hansen, Sylvain Perron
Remarks on solutions to a nonconvex quadratic programming test problem. J. Glob. Optim. 50 (2) (2011)
Steven D. Noble, Pierre Hansen, Nenad Mladenovic
Maximizing edge-ratio is NP-complete. Discret. Appl. Math. 159 (18) (2011)
Pierre Hansen
Bruno Simeone's Work in Clustering. CTW (2011)
Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron
The small hexagon and heptagon with maximum sum of distances between vertices. J. Glob. Optim. 49 (3) (2011)
Pierre Hansen, Christophe Meyer
A new column generation algorithm for Logical Analysis of Data. Ann. Oper. Res. 188 (1) (2011)
Alberto Costa, Pierre Hansen, Leo Liberti
Static Symmetry Breaking in Circle Packing. CTW (2010)
Mustapha Aouchiche, Pierre Hansen
Nordhaus-Gaddum relations for proximity and remoteness in graphs. Comput. Math. Appl. 59 (8) (2010)
Carla Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia de Abreu, Pierre Hansen
Bounds on the index of the signless Laplacian of a graph. Discret. Appl. Math. 158 (4) (2010)
Jack Brimberg, Pierre Hansen, Nenad Mladenovic
Attraction probabilities in variable neighborhood search. 4OR 8 (2) (2010)
Alberto Costa, Leo Liberti, Pierre Hansen
Formulation symmetries in circle packing. Electron. Notes Discret. Math. 36 (2010)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175 (1) (2010)
Charles Audet, Xavier Fournier, Pierre Hansen, Frédéric Messine
A note on diameters of point sets. Optim. Lett. 4 (4) (2010)
Mustapha Aouchiche, Pierre Hansen
On a conjecture about the Szeged index. Eur. J. Comb. 31 (7) (2010)
Jelena Sedlar, Damir Vukicevic, Mustapha Aouchiche, Pierre Hansen
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number. Stud. Inform. Univ. 8 (2) (2010)
Sylvain Perron, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic
Exact and heuristic solutions of the global supply chain problem with transfer pricing. Eur. J. Oper. Res. 202 (3) (2010)
Adel Bessadok, Pierre Hansen, Abdelwaheb Rebaï
EM algorithm and varible Neighborhood Search for fitting Finite Mixture Model parameters. IMCSIT (2009)
Charles Audet, Pierre Hansen, Frédéric Messine
Isoperimetric Polygons of Maximum Width. Discret. Comput. Geom. 41 (1) (2009)
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat
NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75 (2) (2009)
Mustapha Aouchiche, Pierre Hansen, Dragan Stevanovic
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index. Discuss. Math. Graph Theory 29 (1) (2009)
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille. RAIRO Oper. Res. 43 (4) (2009)
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
Average distance and maximum induced forest. J. Graph Theory 60 (1) (2009)
Pierre Hansen, Damir Vukicevic
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. Discret. Math. 309 (13) (2009)
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19 (3) (2009)
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. Discret. Appl. Math. 157 (17) (2009)
Pierre Hansen, Vittorio Maniezzo, Stefan Voß
Special issue on mathematical contributions to metaheuristics editorial. J. Heuristics 15 (3) (2009)
Charles Audet, Pierre Hansen, Frédéric Messine
Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discret. Comput. Geom. 41 (2) (2009)
Charles Audet, Slim Belhaiza, Pierre Hansen
A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games. IGTR 11 (4) (2009)
Pierre Hansen, Christophe Meyer
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. Discret. Appl. Math. 157 (6) (2009)
Qiu-Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen
A restarted and modified simplex search for unconstrained optimization. Comput. Oper. Res. 36 (12) (2009)
Rafael Blanquero, Emilio Carrizosa, Pierre Hansen
Locating Objects in the Plane Using Global Optimization Techniques. Math. Oper. Res. 34 (4) (2009)
Pierre Hansen, Martine Labbé, David Schindl
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discret. Optim. 6 (2) (2009)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighbourhood search: methods and applications. 4OR 6 (4) (2008)
Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic
The maximum return-on-investment plant location problem with market share. J. Oper. Res. Soc. 59 (3) (2008)
Pierre Hansen, Nenad Mladenovic
-median problem. Stat. Comput. 18 (1) (2008)
Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. Discret. Appl. Math. 156 (13) (2008)
Pierre Hansen, Ceyda Oguz, Nenad Mladenovic
Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191 (3) (2008)
Mustapha Aouchiche, Francis K. Bell, Dragos M. 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. Eur. J. Oper. Res. 191 (3) (2008)
Pierre Hansen, Sylvain Perron
Merging the local and global approaches to probabilistic satisfiability. Int. J. Approx. Reason. 47 (2) (2008)
Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng, Sylvain Perron
-norm plane separation. Optim. Lett. 2 (4) (2008)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighborhood search. Eur. J. Oper. Res. 191 (3) (2008)
Pierre Hansen, Dragan Stevanovic
On bags and bugs. Discret. Appl. Math. 156 (7) (2008)
Charles Audet, Pierre Hansen, Frédéric Messine
The small octagon with longest perimeter. J. Comb. Theory, Ser. A 114 (1) (2007)
Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leonardo 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)
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. INFORMS J. Comput. 19 (4) (2007)
Pierre Hansen, Nikolaj van Omme
On pitfalls in computing the geodetic number of a graph. Optim. Lett. 1 (3) (2007)
Pierre Hansen, Jean-Louis Lagouanelle, Frédéric Messine
Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis. J. Glob. Optim. 37 (2) (2007)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG (2007)
Charles Audet, Pierre Hansen, Frédéric Messine
Extremal problems for convex polygons. J. Glob. Optim. 38 (2) (2007)
Pierre Hansen, Sylvain Perron
-Embeddability and Related Problems. J. Classif. 24 (2) (2007)
Mustapha Aouchiche, Pierre Hansen
On a conjecture about the Randic index. Discret. Math. 307 (2) (2007)

Pierre Hansen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Hansen