Degrees and independent sets of hypergraphs. - Pierre Hansen; Michel Lorea (Discret. Math., 1976)

A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. - Pierre Hansen (Inf. Process. Lett., 1976)

Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. - Pierre Hansen (Inf. Process. Lett., 1976)

An O(tm log D) Algorithm for shortest paths. - Pierre Hansen (Discret. Appl. Math., 1980)

Technical Note - Location Theory, Dominance, and Convexity: Some Further Results. - Pierre Hansen; J. Perreur; Jacques-François Thisse (Oper. Res., 1980)

Bicriterion Cluster Analysis. - Michel Delattre; Pierre Hansen (IEEE Trans. Pattern Anal. Mach. Intell., 1980)

Recognizing sign solvable graphs. - Pierre Hansen (Discret. Appl. Math., 1983)

Roof duality, complementation and persistency in quadratic 0-1 optimization. - Peter L. Hammer; Pierre Hansen; Bruno Simeone (Math. Program., 1984)

Uniquely solvable quadratic boolean equations. - Pierre Hansen; Brigitte Jaumard (Discret. Appl. Math., 1985)

The Minisum and Minimax Location Problems Revisited. - Pierre Hansen; Dominique Peeters; Denis Richard; Jacques-François Thisse (Oper. Res., 1985)

Unimodular functions. - Pierre Hansen; Bruno Simeone (Discret. Appl. Math., 1986)

Equivalence of Solutions to Network Location Problems. - Pierre Hansen; Jacques-François Thisse; Richard E. Wendell (Math. Oper. Res., 1986)

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities. - Pierre Hansen; Brigitte Jaumard; Michel Minoux (Math. Program., 1986)

Efficient points on a network. - Pierre Hansen; Jacques-François Thisse; Richard E. Wendell (Networks, 1986)

Algorithms for Voting and Competitive Location on a Network. - Pierre Hansen; Martine Labbé (Transp. Sci., 1988)

The continuous p-median of a network. - Pierre Hansen; Martine Labbé (Networks, 1989)

Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem. - Pierre Hansen; Marcus Poggi de Aragão; Celso C. Ribeiro (Ann. Math. Artif. Intell., 1990)

Algorithms for the maximum satisfiability problem. - Pierre Hansen; Brigitte Jaumard (Computing, 1990)

The basic algorithm for pseudo-Boolean programming revisited. - Yves Crama; Pierre Hansen; Brigitte Jaumard (Discret. Appl. Math., 1990)

On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization. - Pierre Hansen; Shi-Hui Lu; Bruno Simeone (Discret. Appl. Math., 1990)

Preface. - Pierre Hansen; Dominique de Werra (Discret. Appl. Math., 1990)

Commuters' Paths with Penalties for Early or Late Arrival Time. - André de Palma; Pierre Hansen; Martine Labbé (Transp. Sci., 1990)

Acknowledgement. - Peter L. Hammer; Pierre Hansen; Fred S. Roberts (Discret. Appl. Math., 1991)

The continuous center set of a network. - Pierre Hansen; Martine Labbé; Brigitte Nicolas (Discret. Appl. Math., 1991)

The smallest hard-to-color graph. - Pierre Hansen; Julio Kuplinsky (Discret. Math., 1991)

Column Generation Methods for Probabilistic Logic. - Brigitte Jaumard; Pierre Hansen; Marcus Poggi de Aragão (INFORMS J. Comput., 1991)

On Timonov's algorithm for global optimization of univariate Lipschitz functions. - Pierre Hansen; Brigitte Jaumard; Shi-Hui Lu (J. Glob. Optim., 1991)

On the Number of Iterations of Piyavskii's Global Optimization Algorithm. - Pierre Hansen; Brigitte Jaumard; Shi-Hui Lu (Math. Oper. Res., 1991)

Hyperbolic 0-1 programming and query optimization in information retrieval. - Pierre Hansen; Marcus Poggi de Aragão; Celso C. Ribeiro (Math. Program., 1991)

An analytical approach to global optimization. - Pierre Hansen; Brigitte Jaumard; Shi-Hui Lu (Math. Program., 1991)

On-line and off-line vertex enumeration by adjacency lists. - Pey-Chun Chen; Pierre Hansen; Brigitte Jaumard (Oper. Res. Lett., 1991)

Detection of spurious states of neural networks. - Yves Crama; Pierre Hansen; Brigitte Jaumard (IEEE Trans. Neural Networks, 1991)

Reduction of indefinite quadratic programs to bilinear programs. - Pierre Hansen; Brigitte Jaumard (J. Glob. Optim., 1992)

Global optimization of univariate Lipschitz functions: I. Survey and properties. - Pierre Hansen; Brigitte Jaumard; Shi-Hui Lu (Math. Program., 1992)

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. - Pierre Hansen; Brigitte Jaumard; Shi-Hui Lu (Math. Program., 1992)

New Branch-and-Bound Rules for Linear Bilevel Programming. - Pierre Hansen; Brigitte Jaumard; Gilles Savard (SIAM J. Sci. Comput., 1992)

Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing. - Pierre Hansen; Keh-Wei Lih (IEEE Trans. Computers, 1992)

A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs. - Sylvie Gélinas; Pierre Hansen; Brigitte Jaumard (Partitioning Data Sets, 1993)

How to Choose K Entities Among N. - Pierre Hansen; Brigitte Jaumard; Nenad Mladenovic (Partitioning Data Sets, 1993)

Bounded vertex colorings of graphs. - Pierre Hansen; Alain Hertz; Julio Kuplinsky (Discret. Math., 1993)

A linear algorithm for perfect matching in hexagonal systems. - Pierre Hansen; Maolin Zheng (Discret. Math., 1993)

State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming. - Pierre Hansen; Brigitte Jaumard; Vincent Mathon (INFORMS J. Comput., 1993)

Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions. - Pierre Hansen; Brigitte Jaumard; Junjie Xiong (J. Glob. Optim., 1993)

Sharp bounds on the order, size, and stability number of graphs. - Pierre Hansen; Maolin Zheng (Networks, 1993)

Coding Chemical Trees with the Centered N-tuple Code. - Pierre Hansen; Brigitte Jaumard; Catherine Lebatteux; Maolin Zheng (J. Chem. Inf. Comput. Sci., 1994)

Bonds Fixed by Fixing Bonds. - Pierre Hansen; Maolin Zheng (J. Chem. Inf. Comput. Sci., 1994)

Numerical Bounds for the Perfect Matching Vectors of a Polyhex. - Pierre Hansen; Maolin Zheng (J. Chem. Inf. Comput. Sci., 1994)

Finding maximum likelihood estimators for the three-parameter Weibull distribution. - Éric Gourdin; Pierre Hansen; Brigitte Jaumard (J. Glob. Optim., 1994)

Probabilistic Satisfiability and Decomposition. - Guy-Blaise Douanya Nguetsé; Pierre Hansen; Brigitte Jaumard (ECSQARU, 1995)

Models and Algorithms for Probabilistic and Bayesian Logic. - Pierre Hansen; Brigitte Jaumard; Guy-Blaise Douanya Nguetsé; Marcus Poggi de Aragão (IJCAI, 1995)

Assigning a Kekulé Structure to a Conjugated Molecule. - Pierre Hansen; Maolin Zheng (Comput. Chem., 1995)

Boole's Conditions of Possible Experience and Reasoning under Uncertainty. - Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Aragão (Discret. Appl. Math., 1995)

Finding a Kekule Structure in a Benzenoid System in Linear Time. - Pierre Hansen; Brigitte Jaumard; Horst Sachs; Maolin Zheng (J. Chem. Inf. Comput. Sci., 1995)

Complexity of Product Positioning and Ball Intersection Problems. - Yves Crama; Pierre Hansen; Brigitte Jaumard (Math. Oper. Res., 1995)

Nesticity. - Pierre Hansen; Dominique de Werra (Mathematical Hierarchies and Biology, 1996)

Heuristic reliability optimization by tabu search. - Pierre Hansen; Keh-Wei Lih (Ann. Oper. Res., 1996)

Shortest Shortest Path Trees of a Network. - Pierre Hansen; Maolin Zheng (Discret. Appl. Math., 1996)

An Impossibility Result in Axiomatic Location Theory. - Pierre Hansen; Fred S. Roberts (Math. Oper. Res., 1996)

Variable neighborhood search. - Nenad Mladenovic; Pierre Hansen (Comput. Oper. Res., 1997)

Paths with Minimum Range and Ratio of Arc Lengths. - Pierre Hansen; Giovanni Storchi; Tsevi Vovor (Discret. Appl. Math., 1997)

Splitting trees. - Pierre Hansen; Alain Hertz; Nicolas Quinodoz (Discret. Math., 1997)

Perfect matchings and ears in elementary bipartite graphs. - Pierre Hansen; Fuji Zhang; Maolin Zheng (Discret. Math., 1997)

Mixed graph colorings. - Pierre Hansen; Julio Kuplinsky; Dominique de Werra (Math. Methods Oper. Res., 1997)

Cluster analysis and mathematical programming. - Pierre Hansen; Brigitte Jaumard (Math. Program., 1997)

Enumeration of fusenes to h = 20. - Gilles Caporossi; Pierre Hansen; Maolin Zheng (Discrete Mathematical Chemistry, 1998)

Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem. - Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Aragão (Eur. J. Oper. Res., 1998)

Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming. - Pey-Chun Chen; Pierre Hansen; Brigitte Jaumard; Hoang Tuy (Oper. Res., 1998)

Enumeration of Polyhex Hydrocarbons to h = 21. - Gilles Caporossi; Pierre Hansen (J. Chem. Inf. Comput. Sci., 1998)

Heuristic solution of the multisource Weber problem as a p-median problem. - Pierre Hansen; Nenad Mladenovic; Éric D. Taillard (Oper. Res. Lett., 1998)

Finding Relations in Polynomial Time. - Gilles Caporossi; Pierre Hansen (IJCAI, 1999)

On the Relations between Probabilistic Logic and p-CMS. - Pierre Hansen; Brigitte Jaumard; A. D. Parreira (IJCAI, 1999)

Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index. - Gilles Caporossi; Ivan Gutman; Pierre Hansen (Comput. Chem., 1999)

On Lower Bounds for Numbered Complete Graphs. - Pierre Hansen; Brigitte Jaumard; Christophe Meyer (Discret. Appl. Math., 1999)

Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. - Pierre Hansen; Brigitte Jaumard; Guy-Blaise Douanya Nguetsé (Discret. Appl. Math., 1999)

Stabilized column generation. - Olivier du Merle; Daniel Villeneuve; Jacques Desrosiers; Pierre Hansen (Discret. Math., 1999)

Nash Equilibria from the Correlated Equilibria Viewpoint. - Sabrina Gomez Canovas; Pierre Hansen; Brigitte Jaumard (IGTR, 1999)

The Assignment Problem with Seniority and Job Priority Constraints. - Gaétan Caron; Pierre Hansen; Brigitte Jaumard (Oper. Res., 1999)

Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. - Gilles Caporossi; Drago Cvetkovi; Ivan Gutman; Pierre Hansen (J. Chem. Inf. Comput. Sci., 1999)

A symmetrical linear maxmin approach to disjoint bilinear programming. - Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard (Math. Program., 1999)

An Interior Point Algorithm for Minimum Sum-of-Squares Clustering. - Olivier du Merle; Pierre Hansen; Brigitte Jaumard; Nenad Mladenovic (SIAM J. Sci. Comput., 1999)

Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. - Gilles Caporossi; Pierre Hansen (Discret. Math., 2000)

AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory. - Pierre Hansen; Gilles Caporossi (Electron. Notes Discret. Math., 2000)

Probabilistic satisfiability with imprecise probabilities. - Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Aragão; Fabien Chauny; Sylvain Perron (Int. J. Approx. Reason., 2000)

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem. - Jack Brimberg; Pierre Hansen; Nenad Mladenovic; Éric D. Taillard (Oper. Res., 2000)

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. - Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard (Math. Program., 2000)

How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? - Pierre Hansen (Graphs and Discovery, 2001)

What Forms Do Interesting Conjectures Have in Graph Theory? - Pierre Hansen; Mustapha Aouchiche; Gilles Caporossi; Hadrien Mélot; Dragan Stevanovic (Graphs and Discovery, 2001)

Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. - Pierre Hansen; Hadrien Mélot (Graphs and Discovery, 2001)

Variable neighborhood search: Principles and applications. - Pierre Hansen; Nenad Mladenovic (Eur. J. Oper. Res., 2001)

Variable Neighborhood Decomposition Search. - Pierre Hansen; Nenad Mladenovic; Dionisio Pérez-Brito (J. Heuristics, 2001)

A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees. - Roberto Aringhieri; Pierre Hansen; Federico Malucelli (J. Chem. Inf. Comput. Sci., 2001)

J-MEANS: a new local search heuristic for minimum sum of squares clustering. - Pierre Hansen; Nenad Mladenovic (Pattern Recognit., 2001)

Enumeration of All Extreme Equilibria of Bimatrix Games. - Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard (SIAM J. Sci. Comput., 2001)

Boundary uniqueness of fusenes. - Xiaofeng Guo; Pierre Hansen; Maolin Zheng (Discret. Appl. Math., 2002)

Polynomial algorithms for nested univariate clustering. - Pierre Hansen; Brigitte Jaumard; Bruno Simeone (Discret. Math., 2002)

The maximum capture problem with random utilities: Problem formulation and algorithms. - Stefano Benati; Pierre Hansen (Eur. J. Oper. Res., 2002)

Extension of Turán's Theorem to the 2-Stability Number. - Michael U. Gerber; Pierre Hansen; Alain Hertz (Graphs Comb., 2002)

A constructive enumeration of fusenes and benzenoids. - Gunnar Brinkmann; Gilles Caporossi; Pierre Hansen (J. Algorithms, 2002)

The Largest Small Octagon. - Charles Audet; Pierre Hansen; Frédéric Messine; Junjie Xiong (J. Comb. Theory A, 2002)

A note on reduction of quadratic and bilinear programs with equality constraints. - Jack Brimberg; Pierre Hansen; Nenad Mladenovic (J. Glob. Optim., 2002)

Fuzzy J-Means: a new heuristic for fuzzy clustering. - Nabil Belacel; Pierre Hansen; Nenad Mladenovic (Pattern Recognit., 2002)

Chemical trees enumeration algorithms. - Roberto Aringhieri; Pierre Hansen; Federico Malucelli (4OR, 2003)

Búsqueda de Entorno Variable. - Pierre Hansen; Nenad Mladenovic; José A. Moreno-Pérez (Inteligencia Artif., 2003)

Graphs with maximum connectivity index. - Gilles Caporossi; Ivan Gutman; Pierre Hansen; Ljiljana Pavlovic (Comput. Biol. Chem., 2003)

Maximum Split Clustering Under Connectivity Constraints. - Pierre Hansen; Brigitte Jaumard; Christophe Meyer; Bruno Simeone; Valeria Doring (J. Classif., 2003)

An Oil Pipeline Design Problem. - Jack Brimberg; Pierre Hansen; Keh-Wei Lin; Nenad Mladenovic; Michèle Breton (Oper. Res., 2003)

Using stable sets to bound the chromatic number. - Dominique de Werra; Pierre Hansen (Inf. Process. Lett., 2003)

A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons. - Gunnar Brinkmann; Gilles Caporossi; Pierre Hansen (J. Chem. Inf. Comput. Sci., 2003)

Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index. - Pierre Hansen; Hadrien Mélot (J. Chem. Inf. Comput. Sci., 2003)

Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. - Nenad Mladenovic; Martine Labbé; Pierre Hansen (Networks, 2003)

Variable neighborhood search for the maximum clique. - Pierre Hansen; Nenad Mladenovic; Dragan Urosevic (Discret. Appl. Math., 2004)

Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures. - Gilles Caporossi; Pierre Hansen (Discret. Math., 2004)

Cooperative Parallel Variable Neighborhood Search for the p-Median. - Teodor Gabriel Crainic; Michel Gendreau; Pierre Hansen; Nenad Mladenovic (J. Heuristics, 2004)

On the geometry of Nash equilibria and correlated equilibria. - Robert F. Nau; Sabrina Gomez Canovas; Pierre Hansen (Int. J. Game Theory, 2004)

The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal. - Charles Audet; Pierre Hansen; Frédéric Messine; Sylvain Perron (J. Comb. Theory A, 2004)

An Exact Method for Fractional Goal Programming. - Charles Audet; Emilio Carrizosa; Pierre Hansen (J. Glob. Optim., 2004)

Improving Interval Analysis Bounds by Translations. - Emilio Carrizosa; Pierre Hansen; Frédéric Messine (J. Glob. Optim., 2004)

Pooling Problem: Alternate Formulations and Solution Methods. - Charles Audet; Jack Brimberg; Pierre Hansen; Sébastien Le Digabel; Nenad Mladenovic (Manag. Sci., 2004)

Variations on the Roy-Gallai theorem. - Dominique de Werra; Pierre Hansen (4OR, 2005)

Heuristic Procedures for Solving the Discrete Ordered Median Problem. - Patricia Domínguez-Marín; Stefan Nickel; Pierre Hansen; Nenad Mladenovic (Ann. Oper. Res., 2005)

Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays. - Tatjana Davidovic; Pierre Hansen; Nenad Mladenovic (Asia Pac. J. Oper. Res., 2005)

Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. - Pierre Hansen; Eric Ngai; Bernard K.-S. Cheung; Nenad Mladenovic (J. Classif., 2005)

On uniform k-partition problems. - Paolo Dell'Olmo; Pierre Hansen; Stefano Pallottino; Giovanni Storchi (Discret. Appl. Math., 2005)

AutoGraphiX: a survey. - Mustapha Aouchiche; Gilles Caporossi; Pierre Hansen; M. Laffay (Electron. Notes Discret. Math., 2005)

Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. - Ivan Gutman; Pierre Hansen; Hadrien Mélot (J. Chem. Inf. Model., 2005)

Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille. - Mustapha Aouchiche; Pierre Hansen (RAIRO Oper. Res., 2005)

Variable neighborhood search and local branching. - Pierre Hansen; Nenad Mladenovic; Dragan Urosevic (Comput. Oper. Res., 2006)

First vs. best improvement: An empirical study. - Pierre Hansen; Nenad Mladenovic (Discret. Appl. Math., 2006)

A note on duality gap in the simple plant location problem. - Nenad Mladenovic; Jack Brimberg; Pierre Hansen (Eur. J. Oper. Res., 2006)

Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. - Nair Maria Maia de Abreu; Pierre Hansen; Carla Silva Oliveira; Leonardo Silva de Lima (CTW, 2007)

Improving Frequent Subgraph Mining in the Presence of Symmetry. - Christian Desrosiers; Philippe Galinier; Pierre Hansen; Alain Hertz (MLG, 2007)

Algorithms for l1-Embeddability and Related Problems. - Pierre Hansen; Sylvain Perron (J. Classif., 2007)

On a conjecture about the Randic index. - Mustapha Aouchiche; Pierre Hansen (Discret. Math., 2007)

The p-median problem: A survey of metaheuristic approaches. - Nenad Mladenovic; Jack Brimberg; Pierre Hansen; José A. Moreno-Pérez (Eur. J. Oper. Res., 2007)

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. - Pierre Hansen; Jack Brimberg; Dragan Urosevic; Nenad Mladenovic (INFORMS J. Comput., 2007)

The small octagon with longest perimeter. - Charles Audet; Pierre Hansen; Frédéric Messine (J. Comb. Theory A, 2007)

Extremal problems for convex polygons. - Charles Audet; Pierre Hansen; Frédéric Messine (J. Glob. Optim., 2007)

Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis. - Pierre Hansen; Jean-Louis Lagouanelle; Frédéric Messine (J. Glob. Optim., 2007)

On pitfalls in computing the geodetic number of a graph. - Pierre Hansen; Nikolaj van Omme (Optim. Lett., 2007)

Variable neighbourhood search: methods and applications. - Pierre Hansen; Nenad Mladenovic; José A. Moreno-Pérez (4OR, 2008)

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. - Mustapha Aouchiche; Gunnar Brinkmann; Pierre Hansen (Discret. Appl. Math., 2008)

On bags and bugs. - Pierre Hansen; Dragan Stevanovic (Discret. Appl. Math., 2008)

Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. - Mustapha Aouchiche; Francis K. Bell; Dragos M. Cvetkovic; Pierre Hansen; Peter Rowlinson; Slobodan K. Simic; Dragan Stevanovic (Eur. J. Oper. Res., 2008)

Variable neighborhood search. - Pierre Hansen; Nenad Mladenovic; José A. Moreno-Pérez (Eur. J. Oper. Res., 2008)

Variable neighborhood search for minimum cost berth allocation. - Pierre Hansen; Ceyda Oguz; Nenad Mladenovic (Eur. J. Oper. Res., 2008)

Merging the local and global approaches to probabilistic satisfiability. - Pierre Hansen; Sylvain Perron (Int. J. Approx. Reason., 2008)

The maximum return-on-investment plant location problem with market share. - Jack Brimberg; Pierre Hansen; Gilbert Laporte; Nenad Mladenovic; Dragan Urosevic (J. Oper. Res. Soc., 2008)

Exact L 2-norm plane separation. - Charles Audet; Pierre Hansen; Alejandro Karam; Chi To Ng 001; Sylvain Perron (Optim. Lett., 2008)

Complement to a comparative analysis of heuristics for the p -median problem. - Pierre Hansen; Nenad Mladenovic (Stat. Comput., 2008)

EM algorithm and varible Neighborhood Search for fitting Finite Mixture Model parameters. - Adel Bessadok; Pierre Hansen; Abdelwaheb Rebaï (IMCSIT, 2009)

Mining Graphs to Discover New Theorems in Mathematics. - Christian Desrosiers; Alain Hertz; Philippe Galinier; Pierre Hansen (MLG/SRL@ILP, 2009)

A restarted and modified simplex search for unconstrained optimization. - Qiu-Hong Zhao; Dragan Urosevic; Nenad Mladenovic; Pierre Hansen (Comput. Oper. Res., 2009)

Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. - Mustapha Aouchiche; Odile Favaron; Pierre Hansen (Discret. Appl. Math., 2009)

Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. - Pierre Hansen; Christophe Meyer (Discret. Appl. Math., 2009)

Solving large p-median clustering problems by primal-dual variable neighborhood search. - Pierre Hansen; Jack Brimberg; Dragan Urosevic; Nenad Mladenovic (Data Min. Knowl. Discov., 2009)

Isoperimetric Polygons of Maximum Width. - Charles Audet; Pierre Hansen; Frédéric Messine (Discret. Comput. Geom., 2009)

Simple Polygons of Maximum Perimeter Contained in a Unit Disk. - Charles Audet; Pierre Hansen; Frédéric Messine (Discret. Comput. Geom., 2009)

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. - Pierre Hansen; Martine Labbé; David Schindl (Discret. Optim., 2009)

Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. - Pierre Hansen; Damir Vukicevic (Discret. Math., 2009)

Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index. - Mustapha Aouchiche; Pierre Hansen; Dragan Stevanovic (Discuss. Math. Graph Theory, 2009)

Special issue on mathematical contributions to metaheuristics editorial. - Pierre Hansen; Vittorio Maniezzo; Stefan Voß 001 (J. Heuristics, 2009)

A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games. - Charles Audet; Slim Belhaiza; Pierre Hansen (IGTR, 2009)

Average distance and maximum induced forest. - Pierre Hansen; Alain Hertz; Rim Kilani; Odile Marcotte; David Schindl (J. Graph Theory, 2009)

NP-hardness of Euclidean sum-of-squares clustering. - Daniel Aloise; Amit Deshpande 001; Pierre Hansen; Preyas Popat (Mach. Learn., 2009)

Locating Objects in the Plane Using Global Optimization Techniques. - Rafael Blanquero; Emilio Carrizosa; Pierre Hansen (Math. Oper. Res., 2009)

Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille. - Mustapha Aouchiche; Odile Favaron; Pierre Hansen (RAIRO Oper. Res., 2009)

Variable Neighborhood Search Methods. - Pierre Hansen; Nenad Mladenovic (Encyclopedia of Optimization, 2009)

Static Symmetry Breaking in Circle Packing. - Alberto Costa; Pierre Hansen; Leo Liberti (CTW, 2010)

Attraction probabilities in variable neighborhood search. - Jack Brimberg; Pierre Hansen; Nenad Mladenovic (4OR, 2010)

Nordhaus-Gaddum relations for proximity and remoteness in graphs. - Mustapha Aouchiche; Pierre Hansen (Comput. Math. Appl., 2010)

Bounds on the index of the signless Laplacian of a graph. - Carla Silva Oliveira; Leonardo Silva de Lima; Nair Maria Maia de Abreu; Pierre Hansen (Discret. Appl. Math., 2010)

On a conjecture about the Szeged index. - Mustapha Aouchiche; Pierre Hansen (Eur. J. Comb., 2010)

Formulation symmetries in circle packing. - Alberto Costa; Leo Liberti; Pierre Hansen (Electron. Notes Discret. Math., 2010)

Exact and heuristic solutions of the global supply chain problem with transfer pricing. - Sylvain Perron; Pierre Hansen; Sébastien Le Digabel; Nenad Mladenovic (Eur. J. Oper. Res., 2010)

A note on diameters of point sets. - Charles Audet; Xavier Fournier; Pierre Hansen; Frédéric Messine (Optim. Lett., 2010)

Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number. - Jelena Sedlar; Damir Vukicevic; Mustapha Aouchiche; Pierre Hansen (Stud. Inform. Univ., 2010)

Bound constraints for Point Packing in a Square. - Alberto Costa; Pierre Hansen; Leo Liberti (CTW, 2011)

Bruno Simeone's Work in Clustering. - Pierre Hansen (CTW, 2011)

The price of equity in the Hazmat. - Fabio Roda; Pierre Hansen; Leo Liberti (CTW, 2011)

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. - Endre Boros; Yves Crama; Dominique de Werra; Pierre Hansen; Frédéric Maffray (Ann. Oper. Res., 2011)

A new column generation algorithm for Logical Analysis of Data. - Pierre Hansen; Christophe Meyer (Ann. Oper. Res., 2011)

Using size for bounding expressions of graph invariants. - Jelena Sedlar; Damir Vukicevic; Pierre Hansen (Ann. Oper. Res., 2011)

Maximizing edge-ratio is NP-complete. - Steven D. Noble; Pierre Hansen; Nenad Mladenovic (Discret. Appl. Math., 2011)

Improving constrained pattern mining with first-fail-based heuristics. - Christian Desrosiers; Philippe Galinier; Alain Hertz; Pierre Hansen (Data Min. Knowl. Discov., 2011)

Globally optimal clusterwise regression by mixed logical-quadratic programming. - Réal André Carbonneau; Gilles Caporossi; Pierre Hansen (Eur. J. Oper. Res., 2011)

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. - Daniel Aloise; Pierre Hansen (J. Glob. Optim., 2011)

The small hexagon and heptagon with maximum sum of distances between vertices. - Charles Audet; Anthony Guillou; Pierre Hansen; Frédéric Messine; Sylvain Perron (J. Glob. Optim., 2011)

Remarks on solutions to a nonconvex quadratic programming test problem. - Charles Audet; Pierre Hansen; Sylvain Perron (J. Glob. Optim., 2011)

Proximity and remoteness in graphs: Results and conjectures. - Mustapha Aouchiche; Pierre Hansen (Networks, 2011)

Modularity maximization in networks by variable neighborhood search. - Daniel Aloise; Gilles Caporossi; Pierre Hansen; Leo Liberti; Sylvain Perron; Manuel Ruiz (Graph Partitioning and Graph Clustering, 2012)

A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm. - Gilles Caporossi; Pierre Hansen (LION, 2012)

Compact Relaxations for Polynomial Programming Problems. - Sonia Cafieri; Pierre Hansen; Lucas Létocart; Leo Liberti; Frédéric Messine (SEA, 2012)

On proper refinement of Nash equilibria for bimatrix games. - Slim Belhaiza; Charles Audet; Pierre Hansen (Autom., 2012)

Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression. - Réal André Carbonneau; Gilles Caporossi; Pierre Hansen (Comput. Oper. Res., 2012)

An improved column generation algorithm for minimum sum-of-squares clustering. - Daniel Aloise; Pierre Hansen; Leo Liberti (Math. Program., 2012)

A VNS heuristic for escaping local extrema entrapment in normalized cut clustering. - Pierre Hansen; Manuel Ruiz; Daniel Aloise (Pattern Recognit., 2012)

Sequential clustering with radius and split criteria. - Nenad Mladenovic; Pierre Hansen; Jack Brimberg (Central Eur. J. Oper. Res., 2013)

A survey of Nordhaus-Gaddum type relations. - Mustapha Aouchiche; Pierre Hansen (Discret. Appl. Math., 2013)

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. - Alberto Costa; Pierre Hansen; Leo Liberti (Discret. Appl. Math., 2013)

The Small Octagons of Maximal Width. - Charles Audet; Pierre Hansen; Frédéric Messine; Jordan Ninin (Discret. Comput. Geom., 2013)

Open problems on graph eigenvalues studied with AutoGraphiX. - Mustapha Aouchiche; Gilles Caporossi; Pierre Hansen (EURO J. Comput. Optim., 2013)

Reformulation of a model for hierarchical divisive graph modularity maximization. - Sonia Cafieri; Alberto Costa; Pierre Hansen (Ann. Oper. Res., 2014)

Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization. - Réal André Carbonneau; Gilles Caporossi; Pierre Hansen (J. Classif., 2014)

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. - Slim Belhaiza; Pierre Hansen; Gilbert Laporte (Comput. Oper. Res., 2014)

MaxMinMin p-dispersion problem: A variable neighborhood search approach. - Behnaz Saboonchi; Pierre Hansen; Sylvain Perron (Comput. Oper. Res., 2014)

Improving heuristics for network modularity maximization using an exact algorithm. - Sonia Cafieri; Pierre Hansen; Leo Liberti (Discret. Appl. Math., 2014)

Automated generation of conjectures on forbidden subgraph characterization. - Christian Desrosiers; Philippe Galinier; Pierre Hansen; Alain Hertz (Discret. Appl. Math., 2014)

Editorial. - Karl F. Doerner; Pierre Hansen; Vittorio Maniezzo; Stefan Voß 001 (Discret. Appl. Math., 2014)

Global optimization workshop 2012. - Daniel Aloise; Pierre Hansen; Caroline T. M. Rocha (J. Glob. Optim., 2014)

Column generation bounds for numerical microaggregation. - Daniel Aloise; Pierre Hansen; Caroline T. M. Rocha; Éverton Santi (J. Glob. Optim., 2014)

A locally optimal hierarchical divisive heuristic for bipartite modularity maximization. - Alberto Costa; Pierre Hansen (Optim. Lett., 2014)

On the Weber facility location problem with limited distances and side constraints. - Isaac F. Fernandes; Daniel Aloise; Dario J. Aloise; Pierre Hansen; Leo Liberti (Optim. Lett., 2014)

Variable Neighborhood Search for Edge-Ratio Network Clustering. - Sonia Cafieri; Pierre Hansen; Nenad Mladenovic (Examining Robustness and Vulnerability of Networked Systems, 2014)

A reliable affine relaxation method for global optimization. - Jordan Ninin; Frédéric Messine; Pierre Hansen (4OR, 2015)

Adding cohesion constraints to models for modularity maximization in networks. - Sonia Cafieri; Alberto Costa; Pierre Hansen (J. Complex Networks, 2015)

New heuristic for harmonic means clustering. - Emilio Carrizosa; Abdulrahman Alguwaizani; Pierre Hansen; Nenad Mladenovic (J. Glob. Optim., 2015)

Community detection with the weighted parsimony criterion. - Andrea Bettinelli; Pierre Hansen; Leo Liberti (J. Syst. Sci. Complex., 2015)

Proximity, remoteness and distance eigenvalues of a graph. - Mustapha Aouchiche; Pierre Hansen (Discret. Appl. Math., 2016)

Proximity, remoteness and girth in graphs. - Mustapha Aouchiche; Pierre Hansen (Discret. Appl. Math., 2017)

The geometric-arithmetic index and the chromatic number of connected graphs. - Mustapha Aouchiche; Pierre Hansen (Discret. Appl. Math., 2017)

Variable neighborhood search: basics and variants. - Pierre Hansen; Nenad Mladenovic; Raca Todosijevic; Saïd Hanafi (EURO J. Comput. Optim., 2017)

On the nullity number of graphs. - Mustapha Aouchiche; Pierre Hansen (Electron. J. Graph Theory Appl., 2017)

New VNP for automatic programming. - Souhir Elleuch; Pierre Hansen; Bassem Jarboui; Nenad Mladenovic (Electron. Notes Discret. Math., 2017)

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. - Anis Mjirda; Raca Todosijevic; Saïd Hanafi; Pierre Hansen; Nenad Mladenovic (Int. Trans. Oper. Res., 2017)

On the k-Medoids Model for Semi-supervised Clustering. - Rodrigo Randel; Daniel Aloise; Nenad Mladenovic; Pierre Hansen (ICVNS, 2018)

Cospectrality of graphs with respect to distance matrices. - Mustapha Aouchiche; Pierre Hansen (Appl. Math. Comput., 2018)

On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs. - Kinkar Chandra Das; Mustapha Aouchiche; Pierre Hansen (Discret. Appl. Math., 2018)

Variable Neighborhood Search. - Pierre Hansen; Nenad Mladenovic (Handbook of Heuristics, 2018)

Integral simplex using double decomposition for set partitioning problems. - Omar Foutlane; Issmail El Hallaoui; Pierre Hansen (Comput. Oper. Res., 2019)

A relation between proximity and the third largest distance eigenvalue of a graph. - Seyed Ahmad Mojallal; Pierre Hansen (Discret. Appl. Math., 2021)

Using symbolic calculations to determine largest small polygons. - Charles Audet; Pierre Hansen; Dragutin Svrtan (J. Glob. Optim., 2021)

Global exact optimization for covering a rectangle with 6 circles. - Sonia Cafieri; Pierre Hansen; Frédéric Messine (J. Glob. Optim., 2022)

Distributed Integral Column Generation for Set Partitioning Problems. - Omar Foutlane; Issmail El Hallaoui; Pierre Hansen (Oper. Res. Forum, 2022)

Interpretability, Adaptability and Scalability of Variable Neighborhood Search. - Pierre Hansen; Aidan Riordan; Xavier Hansen (MIC (1), 2024)