Pierre Hansen

243 papers A* 3B 3C 6Journal 209Unranked 15
YearRankTypeTitle / Venue / Authors
2024 — conf
Interpretability, Adaptability and Scalability of Variable Neighborhood Search.
MIC (1)
Pierre Hansen, Aidan Riordan, Xavier Hansen
2023 — ed.
Variable Neighborhood Search - 9th International Conference, ICVNS 2022, Abu Dhabi, United Arab Emirates, October 25-28, 2022, Revised Selected Papers
ICVNS
Andrei Sleptchenko, Angelo Sifaleras, Pierre Hansen
2022 J jnl
Distributed Integral Column Generation for Set Partitioning Problems.
Oper. Res. Forum
Omar Foutlane, Issmail El Hallaoui, Pierre Hansen
2022 J jnl
Global exact optimization for covering a rectangle with 6 circles.
J. Glob. Optim.
Sonia Cafieri, Pierre Hansen, Frédéric Messine
2021 J jnl
A relation between proximity and the third largest distance eigenvalue of a graph.
Discret. Appl. Math.
Seyed Ahmad Mojallal, Pierre Hansen
2021 J jnl
Using symbolic calculations to determine largest small polygons.
J. Glob. Optim.
Charles Audet, Pierre Hansen, Dragutin Svrtan
2019 J jnl
Integral simplex using double decomposition for set partitioning problems.
Comput. Oper. Res.
Omar Foutlane, Issmail El Hallaoui, Pierre Hansen
2018 J jnl
Cospectrality of graphs with respect to distance matrices.
Appl. Math. Comput.
Mustapha Aouchiche, Pierre Hansen
2018 J jnl
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs.
Discret. Appl. Math.
Kinkar Chandra Das, Mustapha Aouchiche, Pierre Hansen
2018 — conf
On the k-Medoids Model for Semi-supervised Clustering.
ICVNS
Rodrigo Randel, Daniel Aloise, Nenad Mladenovic, Pierre Hansen
2018 — ch.
Variable Neighborhood Search.
Handbook of Heuristics
Pierre Hansen, Nenad Mladenovic
2017 J jnl
New VNP for automatic programming.
Electron. Notes Discret. Math.
Souhir Elleuch, Pierre Hansen, Bassem Jarboui, Nenad Mladenovic
2017 J jnl
On the nullity number of graphs.
Electron. J. Graph Theory Appl.
Mustapha Aouchiche, Pierre Hansen
2017 J jnl
Proximity, remoteness and girth in graphs.
Discret. Appl. Math.
Mustapha Aouchiche, Pierre Hansen
2017 J jnl
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.
Int. Trans. Oper. Res.
Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic
2017 J jnl
The geometric-arithmetic index and the chromatic number of connected graphs.
Discret. Appl. Math.
Mustapha Aouchiche, Pierre Hansen
2017 J jnl
Variable neighborhood search: basics and variants.
EURO J. Comput. Optim.
Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi
2016 J jnl
Proximity, remoteness and distance eigenvalues of a graph.
Discret. Appl. Math.
Mustapha Aouchiche, Pierre Hansen
2015 J jnl
A reliable affine relaxation method for global optimization.
4OR
Jordan Ninin, Frédéric Messine, Pierre Hansen
2015 J jnl
Adding cohesion constraints to models for modularity maximization in networks.
J. Complex Networks
Sonia Cafieri, Alberto Costa, Pierre Hansen
2015 J jnl
Community detection with the weighted parsimony criterion.
J. Syst. Sci. Complex.
Andrea Bettinelli, Pierre Hansen, Leo Liberti
2015 J jnl
New heuristic for harmonic means clustering.
J. Glob. Optim.
Emilio Carrizosa, Abdulrahman Alguwaizani, Pierre Hansen, Nenad Mladenovic
2014 J jnl
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.
Comput. Oper. Res.
Slim Belhaiza, Pierre Hansen, Gilbert Laporte
2014 J jnl
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization.
Optim. Lett.
Alberto Costa, Pierre Hansen
2014 J jnl
Automated generation of conjectures on forbidden subgraph characterization.
Discret. Appl. Math.
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
2014 J jnl
Column generation bounds for numerical microaggregation.
J. Glob. Optim.
Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha, Éverton Santi
2014 J jnl
Editorial.
Discret. Appl. Math.
Karl F. Doerner, Pierre Hansen, Vittorio Maniezzo, Stefan Voß
2014 J jnl
Global optimization workshop 2012.
J. Glob. Optim.
Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha
2014 J jnl
Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization.
J. Classif.
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
2014 J jnl
Improving heuristics for network modularity maximization using an exact algorithm.
Discret. Appl. Math.
Sonia Cafieri, Pierre Hansen, Leo Liberti
2014 J jnl
MaxMinMin p-dispersion problem: A variable neighborhood search approach.
Comput. Oper. Res.
Behnaz Saboonchi, Pierre Hansen, Sylvain Perron
2014 J jnl
On the Weber facility location problem with limited distances and side constraints.
Optim. Lett.
Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen, Leo Liberti
2014 J jnl
Reformulation of a model for hierarchical divisive graph modularity maximization.
Ann. Oper. Res.
Sonia Cafieri, Alberto Costa, Pierre Hansen
2014 — ch.
Variable Neighborhood Search for Edge-Ratio Network Clustering.
Examining Robustness and Vulnerability of Networked Systems
Sonia Cafieri, Pierre Hansen, Nenad Mladenovic
2013 J jnl
A survey of Nordhaus-Gaddum type relations.
Discret. Appl. Math.
Mustapha Aouchiche, Pierre Hansen
2013 J jnl
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square.
Discret. Appl. Math.
Alberto Costa, Pierre Hansen, Leo Liberti
2013 J jnl
Open problems on graph eigenvalues studied with AutoGraphiX.
EURO J. Comput. Optim.
Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen
2013 J jnl
Sequential clustering with radius and split criteria.
Central Eur. J. Oper. Res.
Nenad Mladenovic, Pierre Hansen, Jack Brimberg
2013 J jnl
The Small Octagons of Maximal Width.
Discret. Comput. Geom.
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin
2012 — conf
A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm.
LION
Gilles Caporossi, Pierre Hansen
2012 J jnl
A VNS heuristic for escaping local extrema entrapment in normalized cut clustering.
Pattern Recognit.
Pierre Hansen, Manuel Ruiz, Daniel Aloise
2012 J jnl
An improved column generation algorithm for minimum sum-of-squares clustering.
Math. Program.
Daniel Aloise, Pierre Hansen, Leo Liberti
2012 B conf
Compact Relaxations for Polynomial Programming Problems.
SEA
Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine
2012 J jnl
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression.
Comput. Oper. Res.
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
2012 — conf
Modularity maximization in networks by variable neighborhood search.
Graph Partitioning and Graph Clustering
Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz
2012 J jnl
On proper refinement of Nash equilibria for bimatrix games.
Autom.
Slim Belhaiza, Charles Audet, Pierre Hansen
2011 J jnl
A new column generation algorithm for Logical Analysis of Data.
Ann. Oper. Res.
Pierre Hansen, Christophe Meyer
2011 C conf
Bound constraints for Point Packing in a Square.
CTW
Alberto Costa, Pierre Hansen, Leo Liberti
2011 C conf
Bruno Simeone's Work in Clustering.
CTW
Pierre Hansen
2011 J jnl
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering.
J. Glob. Optim.
Daniel Aloise, Pierre Hansen
2011 J jnl
Globally optimal clusterwise regression by mixed logical-quadratic programming.
Eur. J. Oper. Res.
Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
2011 J jnl
Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov.
Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen
2011 J jnl
Maximizing edge-ratio is NP-complete.
Discret. Appl. Math.
Steven D. Noble, Pierre Hansen, Nenad Mladenovic
2011 J jnl
Proximity and remoteness in graphs: Results and conjectures.
Networks
Mustapha Aouchiche, Pierre Hansen
2011 J jnl
Remarks on solutions to a nonconvex quadratic programming test problem.
J. Glob. Optim.
Charles Audet, Pierre Hansen, Sylvain Perron
2011 J jnl
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res.
Endre Boros, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray
2011 C conf
The price of equity in the Hazmat.
CTW
Fabio Roda, Pierre Hansen, Leo Liberti
2011 J jnl
The small hexagon and heptagon with maximum sum of distances between vertices.
J. Glob. Optim.
Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron
2011 J jnl
Using size for bounding expressions of graph invariants.
Ann. Oper. Res.
Jelena Sedlar, Damir Vukicevic, Pierre Hansen
2010 J jnl
A note on diameters of point sets.
Optim. Lett.
Charles Audet, Xavier Fournier, Pierre Hansen, Frédéric Messine
2010 J jnl
Attraction probabilities in variable neighborhood search.
4OR
Jack Brimberg, Pierre Hansen, Nenad Mladenovic
2010 J jnl
Bounds on the index of the signless Laplacian of a graph.
Discret. Appl. Math.
Carla Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia de Abreu, Pierre Hansen
2010 J jnl
Exact and heuristic solutions of the global supply chain problem with transfer pricing.
Eur. J. Oper. Res.
Sylvain Perron, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic
2010 J jnl
Formulation symmetries in circle packing.
Electron. Notes Discret. Math.
Alberto Costa, Leo Liberti, Pierre Hansen
2010 J jnl
Nordhaus-Gaddum relations for proximity and remoteness in graphs.
Comput. Math. Appl.
Mustapha Aouchiche, Pierre Hansen
2010 J jnl
On a conjecture about the Szeged index.
Eur. J. Comb.
Mustapha Aouchiche, Pierre Hansen
2010 C conf
Static Symmetry Breaking in Circle Packing.
CTW
Alberto Costa, Pierre Hansen, Leo Liberti
2010 J jnl
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number.
Stud. Inform. Univ.
Jelena Sedlar, Damir Vukicevic, Mustapha Aouchiche, Pierre Hansen
2010 J jnl
Variable neighbourhood search: methods and applications.
Ann. Oper. Res.
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
2009 J jnl
A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games.
IGTR
Charles Audet, Slim Belhaiza, Pierre Hansen
2009 J jnl
A restarted and modified simplex search for unconstrained optimization.
Comput. Oper. Res.
Qiu-Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen
2009 J jnl
Average distance and maximum induced forest.
J. Graph Theory
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
2009 — conf
EM algorithm and varible Neighborhood Search for fitting Finite Mixture Model parameters.
IMCSIT
Adel Bessadok, Pierre Hansen, Abdelwaheb Rebaï
2009 J jnl
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem.
Discret. Appl. Math.
Pierre Hansen, Christophe Meyer
2009 J jnl
Isoperimetric Polygons of Maximum Width.
Discret. Comput. Geom.
Charles Audet, Pierre Hansen, Frédéric Messine
2009 J jnl
Locating Objects in the Plane Using Global Optimization Techniques.
Math. Oper. Res.
Rafael Blanquero, Emilio Carrizosa, Pierre Hansen
2009 — conf
Mining Graphs to Discover New Theorems in Mathematics.
MLG/SRL@ILP
Christian Desrosiers, Alain Hertz, Philippe Galinier, Pierre Hansen
2009 J jnl
NP-hardness of Euclidean sum-of-squares clustering.
Mach. Learn.
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat
2009 J jnl
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille.
RAIRO Oper. Res.
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
2009 J jnl
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results.
Discret. Optim.
Pierre Hansen, Martine Labbé, David Schindl
2009 J jnl
Simple Polygons of Maximum Perimeter Contained in a Unit Disk.
Discret. Comput. Geom.
Charles Audet, Pierre Hansen, Frédéric Messine
2009 J jnl
Solving large
Data Min. Knowl. Discov.
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
2009 J jnl
Special issue on mathematical contributions to metaheuristics editorial.
J. Heuristics
Pierre Hansen, Vittorio Maniezzo, Stefan Voß
2009 — ch.
Variable Neighborhood Search Methods.
Encyclopedia of Optimization
Pierre Hansen, Nenad Mladenovic
2009 J jnl
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance.
Discret. Appl. Math.
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
2009 J jnl
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number.
Discret. Math.
Pierre Hansen, Damir Vukicevic
2009 J jnl
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index.
Discuss. Math. Graph Theory
Mustapha Aouchiche, Pierre Hansen, Dragan Stevanovic
2008 J jnl
Complement to a comparative analysis of heuristics for the
Stat. Comput.
Pierre Hansen, Nenad Mladenovic
2008 J jnl
Exact
Optim. Lett.
Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng, Sylvain Perron
2008 J jnl
Merging the local and global approaches to probabilistic satisfiability.
Int. J. Approx. Reason.
Pierre Hansen, Sylvain Perron
2008 J jnl
On bags and bugs.
Discret. Appl. Math.
Pierre Hansen, Dragan Stevanovic
2008 J jnl
The maximum return-on-investment plant location problem with market share.
J. Oper. Res. Soc.
Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic
2008 J jnl
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph.
Eur. J. Oper. Res.
Mustapha Aouchiche, Francis K. Bell, Dragos M. Cvetkovic, Pierre Hansen, Peter Rowlinson, Slobodan K. Simic, Dragan Stevanovic
2008 J jnl
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number.
Discret. Appl. Math.
Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen
2008 J jnl
Variable neighborhood search for minimum cost berth allocation.
Eur. J. Oper. Res.
Pierre Hansen, Ceyda Oguz, Nenad Mladenovic
2008 J jnl
Variable neighborhood search.
Eur. J. Oper. Res.
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
2008 J jnl
Variable neighbourhood search: methods and applications.
4OR
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
2007 J jnl
Algorithms for
J. Classif.
Pierre Hansen, Sylvain Perron
2007 C conf
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex.
CTW
Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leonardo Silva de Lima
2007 J jnl
Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis.
J. Glob. Optim.
Pierre Hansen, Jean-Louis Lagouanelle, Frédéric Messine
2007 J jnl
Extremal problems for convex polygons.
J. Glob. Optim.
Charles Audet, Pierre Hansen, Frédéric Messine
2007 — conf
Improving Frequent Subgraph Mining in the Presence of Symmetry.
MLG
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
2007 J jnl
On a conjecture about the Randic index.
Discret. Math.
Mustapha Aouchiche, Pierre Hansen
2007 J jnl
On pitfalls in computing the geodetic number of a graph.
Optim. Lett.
Pierre Hansen, Nikolaj van Omme
2007 J jnl
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
INFORMS J. Comput.
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
2007 J jnl
The p-median problem: A survey of metaheuristic approaches.
Eur. J. Oper. Res.
Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez
2007 J jnl
The small octagon with longest perimeter.
J. Comb. Theory A
Charles Audet, Pierre Hansen, Frédéric Messine
2006 J jnl
A note on duality gap in the simple plant location problem.
Eur. J. Oper. Res.
Nenad Mladenovic, Jack Brimberg, Pierre Hansen
2006 J jnl
First vs. best improvement: An empirical study.
Discret. Appl. Math.
Pierre Hansen, Nenad Mladenovic
2006 J jnl
Variable neighborhood search and local branching.
Comput. Oper. Res.
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
2005 J jnl
Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering.
J. Classif.
Pierre Hansen, Eric Ngai, Bernard K.-S. Cheung, Nenad Mladenovic
2005 J jnl
AutoGraphiX: a survey.
Electron. Notes Discret. Math.
Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen, M. Laffay
2005 — ed.
Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001
Graphs and Discovery
Siemion Fajtlowicz, Patrick W. Fowler, Pierre Hansen, Melvin F. Janowitz, Fred S. Roberts
2005 J jnl
Heuristic Procedures for Solving the Discrete Ordered Median Problem.
Ann. Oper. Res.
Patricia Domínguez-Marín, Stefan Nickel, Pierre Hansen, Nenad Mladenovic
2005 J jnl
On bags and bugs.
Electron. Notes Discret. Math.
Pierre Hansen, Dragan Stevanovic
2005 J jnl
On uniform
Discret. Appl. Math.
Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi
2005 J jnl
Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays.
Asia Pac. J. Oper. Res.
Tatjana Davidovic, Pierre Hansen, Nenad Mladenovic
2005 J jnl
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille.
RAIRO Oper. Res.
Mustapha Aouchiche, Pierre Hansen
2005 J jnl
Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees.
J. Chem. Inf. Model.
Ivan Gutman, Pierre Hansen, Hadrien Mélot
2005 J jnl
Variations on the Roy-Gallai theorem.
4OR
Dominique de Werra, Pierre Hansen
2004 J jnl
An Exact Method for Fractional Goal Programming.
J. Glob. Optim.
Charles Audet, Emilio Carrizosa, Pierre Hansen
2004 J jnl
Cooperative Parallel Variable Neighborhood Search for the
J. Heuristics
Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic
2004 J jnl
Improving Interval Analysis Bounds by Translations.
J. Glob. Optim.
Emilio Carrizosa, Pierre Hansen, Frédéric Messine
2004 J jnl
On the geometry of Nash equilibria and correlated equilibria.
Int. J. Game Theory
Robert F. Nau, Sabrina Gomez Canovas, Pierre Hansen
2004 J jnl
Pooling Problem: Alternate Formulations and Solution Methods.
Manag. Sci.
Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic
2004 J jnl
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.
J. Comb. Theory A
Charles Audet, Pierre Hansen, Frédéric Messine, Sylvain Perron
2004 J jnl
Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.
Discret. Math.
Gilles Caporossi, Pierre Hansen
2004 J jnl
Variable neighborhood search for the maximum clique.
Discret. Appl. Math.
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
2003 J jnl
A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons.
J. Chem. Inf. Comput. Sci.
Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
2003 J jnl
An Oil Pipeline Design Problem.
Oper. Res.
Jack Brimberg, Pierre Hansen, Keh-Wei Lin, Nenad Mladenovic, Michèle Breton
2003 J jnl
Búsqueda de Entorno Variable.
Inteligencia Artif.
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
2003 J jnl
Chemical trees enumeration algorithms.
4OR
Roberto Aringhieri, Pierre Hansen, Federico Malucelli
2003 J jnl
Graphs with maximum connectivity index.
Comput. Biol. Chem.
Gilles Caporossi, Ivan Gutman, Pierre Hansen, Ljiljana Pavlovic
2003 J jnl
Maximum Split Clustering Under Connectivity Constraints.
J. Classif.
Pierre Hansen, Brigitte Jaumard, Christophe Meyer, Bruno Simeone, Valeria Doring
2003 J jnl
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search.
Networks
Nenad Mladenovic, Martine Labbé, Pierre Hansen
2003 J jnl
Using stable sets to bound the chromatic number.
Inf. Process. Lett.
Dominique de Werra, Pierre Hansen
2003 J jnl
Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Hadrien Mélot
2002 J jnl
A constructive enumeration of fusenes and benzenoids.
J. Algorithms
Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
2002 J jnl
A note on reduction of quadratic and bilinear programs with equality constraints.
J. Glob. Optim.
Jack Brimberg, Pierre Hansen, Nenad Mladenovic
2002 J jnl
Boundary uniqueness of fusenes.
Discret. Appl. Math.
Xiaofeng Guo, Pierre Hansen, Maolin Zheng
2002 J jnl
Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb.
Michael U. Gerber, Pierre Hansen, Alain Hertz
2002 J jnl
Fuzzy J-Means: a new heuristic for fuzzy clustering.
Pattern Recognit.
Nabil Belacel, Pierre Hansen, Nenad Mladenovic
2002 J jnl
Polynomial algorithms for nested univariate clustering.
Discret. Math.
Pierre Hansen, Brigitte Jaumard, Bruno Simeone
2002 J jnl
The Largest Small Octagon.
J. Comb. Theory A
Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong
2002 J jnl
The maximum capture problem with random utilities: Problem formulation and algorithms.
Eur. J. Oper. Res.
Stefano Benati, Pierre Hansen
2001 J jnl
A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees.
J. Chem. Inf. Comput. Sci.
Roberto Aringhieri, Pierre Hansen, Federico Malucelli
2001 J jnl
Enumeration of All Extreme Equilibria of Bimatrix Games.
SIAM J. Sci. Comput.
Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard
2001 — conf
How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process?
Graphs and Discovery
Pierre Hansen
2001 J jnl
J-M
Pattern Recognit.
Pierre Hansen, Nenad Mladenovic
2001 J jnl
Variable Neighborhood Decomposition Search.
J. Heuristics
Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito
2001 — conf
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.
Graphs and Discovery
Pierre Hansen, Hadrien Mélot
2001 J jnl
Variable neighborhood search: Principles and applications.
Eur. J. Oper. Res.
Pierre Hansen, Nenad Mladenovic
2001 — conf
What Forms Do Interesting Conjectures Have in Graph Theory?
Graphs and Discovery
Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic
2000 J jnl
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming.
Math. Program.
Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard
2000 J jnl
AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory.
Electron. Notes Discret. Math.
Pierre Hansen, Gilles Caporossi
2000 — ed.
Discrete Mathematical Chemistry, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1998
Discrete Mathematical Chemistry
Pierre Hansen, Patrick W. Fowler, Maolin Zheng
2000 J jnl
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.
Oper. Res.
Jack Brimberg, Pierre Hansen, Nenad Mladenovic, Éric D. Taillard
2000 J jnl
Probabilistic satisfiability with imprecise probabilities.
Int. J. Approx. Reason.
Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron
2000 J jnl
Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system.
Discret. Math.
Gilles Caporossi, Pierre Hansen
1999 J jnl
A symmetrical linear maxmin approach to disjoint bilinear programming.
Math. Program.
Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard
1999 J jnl
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering.
SIAM J. Sci. Comput.
Olivier du Merle, Pierre Hansen, Brigitte Jaumard, Nenad Mladenovic
1999 J jnl
Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures.
Discret. Appl. Math.
Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé
1999 A* conf
Finding Relations in Polynomial Time.
IJCAI
Gilles Caporossi, Pierre Hansen
1999 J jnl
Nash Equilibria from the Correlated Equilibria Viewpoint.
IGTR
Sabrina Gomez Canovas, Pierre Hansen, Brigitte Jaumard
1999 J jnl
On Lower Bounds for Numbered Complete Graphs.
Discret. Appl. Math.
Pierre Hansen, Brigitte Jaumard, Christophe Meyer
1999 A* conf
On the Relations between Probabilistic Logic and p-CMS.
IJCAI
Pierre Hansen, Brigitte Jaumard, A. D. Parreira
1999 — conf
Probabilistic Satisfiability with Imprecise Probabilities.
ISIPTA
Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron
1999 J jnl
Stabilized column generation.
Discret. Math.
Olivier du Merle, Daniel Villeneuve, Jacques Desrosiers, Pierre Hansen
1999 J jnl
The Assignment Problem with Seniority and Job Priority Constraints.
Oper. Res.
Gaétan Caron, Pierre Hansen, Brigitte Jaumard
1999 J jnl
Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy.
J. Chem. Inf. Comput. Sci.
Gilles Caporossi, Drago Cvetkovi, Ivan Gutman, Pierre Hansen
1999 J jnl
Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index.
Comput. Chem.
Gilles Caporossi, Ivan Gutman, Pierre Hansen
1998 J jnl
Enumeration of Polyhex Hydrocarbons to h = 21.
J. Chem. Inf. Comput. Sci.
Gilles Caporossi, Pierre Hansen
1998 — conf
Enumeration of fusenes to
Discrete Mathematical Chemistry
Gilles Caporossi, Pierre Hansen, Maolin Zheng
1998 J jnl
Heuristic solution of the multisource Weber problem as a p-median problem.
Oper. Res. Lett.
Pierre Hansen, Nenad Mladenovic, Éric D. Taillard
1998 J jnl
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem.
Eur. J. Oper. Res.
Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão
1998 J jnl
Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming.
Oper. Res.
Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard, Hoang Tuy
1997 J jnl
Cluster analysis and mathematical programming.
Math. Program.
Pierre Hansen, Brigitte Jaumard
1997 J jnl
Mixed graph colorings.
Math. Methods Oper. Res.
Pierre Hansen, Julio Kuplinsky, Dominique de Werra
1997 J jnl
Paths with Minimum Range and Ratio of Arc Lengths.
Discret. Appl. Math.
Pierre Hansen, Giovanni Storchi, Tsevi Vovor
1997 J jnl
Perfect matchings and ears in elementary bipartite graphs.
Discret. Math.
Pierre Hansen, Fuji Zhang, Maolin Zheng
1997 J jnl
Splitting trees.
Discret. Math.
Pierre Hansen, Alain Hertz, Nicolas Quinodoz
1997 J jnl
Variable neighborhood search.
Comput. Oper. Res.
Nenad Mladenovic, Pierre Hansen
1996 J jnl
An Impossibility Result in Axiomatic Location Theory.
Math. Oper. Res.
Pierre Hansen, Fred S. Roberts
1996 J jnl
Heuristic reliability optimization by tabu search.
Ann. Oper. Res.
Pierre Hansen, Keh-Wei Lih
1996 — conf
Nesticity.
Mathematical Hierarchies and Biology
Pierre Hansen, Dominique de Werra
1996 J jnl
Shortest Shortest Path Trees of a Network.
Discret. Appl. Math.
Pierre Hansen, Maolin Zheng
1995 J jnl
Assigning a Kekulé Structure to a Conjugated Molecule.
Comput. Chem.
Pierre Hansen, Maolin Zheng
1995 J jnl
Boole's Conditions of Possible Experience and Reasoning under Uncertainty.
Discret. Appl. Math.
Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão
1995 J jnl
Complexity of Product Positioning and Ball Intersection Problems.
Math. Oper. Res.
Yves Crama, Pierre Hansen, Brigitte Jaumard
1995 J jnl
Finding a Kekule Structure in a Benzenoid System in Linear Time.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Brigitte Jaumard, Horst Sachs, Maolin Zheng
1995 A* conf
Models and Algorithms for Probabilistic and Bayesian Logic.
IJCAI
Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé, Marcus Poggi de Aragão
1995 — ed.
Partitioning Data Sets, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 19-21, 1993
Partitioning Data Sets
Ingemar J. Cox, Pierre Hansen, Béla Julesz
1995 C conf
Probabilistic Satisfiability and Decomposition.
ECSQARU
Guy-Blaise Douanya Nguetsé, Pierre Hansen, Brigitte Jaumard
1994 J jnl
Bonds Fixed by Fixing Bonds.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Maolin Zheng
1994 J jnl
Coding Chemical Trees with the Centered N-tuple Code.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Brigitte Jaumard, Catherine Lebatteux, Maolin Zheng
1994 J jnl
Finding maximum likelihood estimators for the three-parameter Weibull distribution.
J. Glob. Optim.
Éric Gourdin, Pierre Hansen, Brigitte Jaumard
1994 J jnl
Numerical Bounds for the Perfect Matching Vectors of a Polyhex.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Maolin Zheng
1993 — conf
A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs.
Partitioning Data Sets
Sylvie Gélinas, Pierre Hansen, Brigitte Jaumard
1993 J jnl
A linear algorithm for perfect matching in hexagonal systems.
Discret. Math.
Pierre Hansen, Maolin Zheng
1993 J jnl
Bounded vertex colorings of graphs.
Discret. Math.
Pierre Hansen, Alain Hertz, Julio Kuplinsky
1993 J jnl
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions.
J. Glob. Optim.
Pierre Hansen, Brigitte Jaumard, Junjie Xiong
1993 — conf
How to Choose K Entities Among N.
Partitioning Data Sets
Pierre Hansen, Brigitte Jaumard, Nenad Mladenovic
1993 J jnl
Sharp bounds on the order, size, and stability number of graphs.
Networks
Pierre Hansen, Maolin Zheng
1993 J jnl
State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming.
INFORMS J. Comput.
Pierre Hansen, Brigitte Jaumard, Vincent Mathon
1992 J jnl
Global optimization of univariate Lipschitz functions: I. Survey and properties.
Math. Program.
Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
1992 J jnl
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison.
Math. Program.
Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
1992 J jnl
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing.
IEEE Trans. Computers
Pierre Hansen, Keh-Wei Lih
1992 B conf
Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem.
IPCO
Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão
1992 J jnl
New Branch-and-Bound Rules for Linear Bilevel Programming.
SIAM J. Sci. Comput.
Pierre Hansen, Brigitte Jaumard, Gilles Savard
1992 J jnl
Reduction of indefinite quadratic programs to bilinear programs.
J. Glob. Optim.
Pierre Hansen, Brigitte Jaumard
1991 J jnl
Acknowledgement.
Discret. Appl. Math.
Peter L. Hammer, Pierre Hansen, Fred S. Roberts
1991 J jnl
An analytical approach to global optimization.
Math. Program.
Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
1991 J jnl
Column Generation Methods for Probabilistic Logic.
INFORMS J. Comput.
Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão
1991 J jnl
Detection of spurious states of neural networks.
IEEE Trans. Neural Networks
Yves Crama, Pierre Hansen, Brigitte Jaumard
1991 J jnl
Hyperbolic 0-1 programming and query optimization in information retrieval.
Math. Program.
Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro
1991 J jnl
On Timonov's algorithm for global optimization of univariate Lipschitz functions.
J. Glob. Optim.
Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
1991 J jnl
On the Number of Iterations of Piyavskii's Global Optimization Algorithm.
Math. Oper. Res.
Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
1991 J jnl
On-line and off-line vertex enumeration by adjacency lists.
Oper. Res. Lett.
Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard
1991 J jnl
The continuous center set of a network.
Discret. Appl. Math.
Pierre Hansen, Martine Labbé, Brigitte Nicolas
1991 J jnl
The smallest hard-to-color graph.
Discret. Math.
Pierre Hansen, Julio Kuplinsky
1990 J jnl
Algorithms for the maximum satisfiability problem.
Computing
Pierre Hansen, Brigitte Jaumard
1990 J jnl
Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem.
Ann. Math. Artif. Intell.
Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro
1990 B conf
Column Generation Methods for Probabilistic Logic.
IPCO
Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão
1990 J jnl
Commuters' Paths with Penalties for Early or Late Arrival Time.
Transp. Sci.
André de Palma, Pierre Hansen, Martine Labbé
1990 J jnl
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.
Discret. Appl. Math.
Pierre Hansen, Shi-Hui Lu, Bruno Simeone
1990 J jnl
Preface.
Discret. Appl. Math.
Pierre Hansen, Dominique de Werra
1990 J jnl
The basic algorithm for pseudo-Boolean programming revisited.
Discret. Appl. Math.
Yves Crama, Pierre Hansen, Brigitte Jaumard
1989 J jnl
The continuous
Networks
Pierre Hansen, Martine Labbé
1988 J jnl
Algorithms for Voting and Competitive Location on a Network.
Transp. Sci.
Pierre Hansen, Martine Labbé
1986 J jnl
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities.
Math. Program.
Pierre Hansen, Brigitte Jaumard, Michel Minoux
1986 J jnl
Efficient points on a network.
Networks
Pierre Hansen, Jacques-François Thisse, Richard E. Wendell
1986 J jnl
Equivalence of Solutions to Network Location Problems.
Math. Oper. Res.
Pierre Hansen, Jacques-François Thisse, Richard E. Wendell
1986 J jnl
Unimodular functions.
Discret. Appl. Math.
Pierre Hansen, Bruno Simeone
1985 J jnl
The Minisum and Minimax Location Problems Revisited.
Oper. Res.
Pierre Hansen, Dominique Peeters, Denis Richard, Jacques-François Thisse
1985 J jnl
Uniquely solvable quadratic boolean equations.
Discret. Appl. Math.
Pierre Hansen, Brigitte Jaumard
1984 J jnl
Roof duality, complementation and persistency in quadratic 0-1 optimization.
Math. Program.
Peter L. Hammer, Pierre Hansen, Bruno Simeone
1983 J jnl
Recognizing sign solvable graphs.
Discret. Appl. Math.
Pierre Hansen
1980 J jnl
An O(tm log D) Algorithm for shortest paths.
Discret. Appl. Math.
Pierre Hansen
1980 J jnl
Bicriterion Cluster Analysis.
IEEE Trans. Pattern Anal. Mach. Intell.
Michel Delattre, Pierre Hansen
1980 J jnl
Technical Note - Location Theory, Dominance, and Convexity: Some Further Results.
Oper. Res.
Pierre Hansen, J. Perreur, Jacques-François Thisse
1976 J jnl
A Cascade Algorithm for the Logical Closure of a Set of Binary Relations.
Inf. Process. Lett.
Pierre Hansen
1976 J jnl
Degrees and independent sets of hypergraphs.
Discret. Math.
Pierre Hansen, Michel Lorea
1976 J jnl
Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations.
Inf. Process. Lett.
Pierre Hansen