Pierre Hansen
Affiliations:- HEC Montréal, Canada
According to our database1,
Pierre Hansen
authored at least 233 papers
between 1976 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on hec.ca
On csauthors.net:
Bibliography
2024
Proceedings of the Metaheuristics - 15th International Conference, 2024
2022
Oper. Res. Forum, 2022
J. Glob. Optim., 2022
2021
J. Glob. Optim., 2021
Discret. Appl. Math., 2021
2019
Comput. Oper. Res., 2019
2018
Discret. Appl. Math., 2018
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
2017
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.
Int. Trans. Oper. Res., 2017
Discret. Appl. Math., 2017
2016
Discret. Appl. Math., 2016
2015
J. Syst. Sci. Complex., 2015
J. Complex Networks, 2015
2014
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014
Optim. Lett., 2014
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization.
Optim. Lett., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
Comput. Oper. Res., 2014
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.
Comput. Oper. Res., 2014
Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization.
J. Classif., 2014
Ann. Oper. Res., 2014
2013
EURO J. Comput. Optim., 2013
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square.
Discret. Appl. Math., 2013
Central Eur. J. Oper. Res., 2013
2012
Pattern Recognit., 2012
Math. Program., 2012
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression.
Comput. Oper. Res., 2012
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012
Proceedings of the Graph Partitioning and Graph Clustering, 2012
2011
J. Glob. Optim., 2011
J. Glob. Optim., 2011
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering.
J. Glob. Optim., 2011
Eur. J. Oper. Res., 2011
Data Min. Knowl. Discov., 2011
Ann. Oper. Res., 2011
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number.
Stud. Inform. Univ., 2010
Exact and heuristic solutions of the global supply chain problem with transfer pricing.
Eur. J. Oper. Res., 2010
Comput. Math. Appl., 2010
Static Symmetry Breaking in Circle Packing.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille.
RAIRO Oper. Res., 2009
Math. Oper. Res., 2009
A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games.
IGTR, 2009
J. Heuristics, 2009
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index.
Discuss. Math. Graph Theory, 2009
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number.
Discret. Math., 2009
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results.
Discret. Optim., 2009
Discret. Comput. Geom., 2009
Solving large <i>p</i>-median clustering problems by primal-dual variable neighborhood search.
Data Min. Knowl. Discov., 2009
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem.
Discret. Appl. Math., 2009
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance.
Discret. Appl. Math., 2009
Comput. Oper. Res., 2009
EM algorithm and varible Neighborhood Search for fitting Finite Mixture Model parameters.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009
2008
Stat. Comput., 2008
J. Oper. Res. Soc., 2008
Int. J. Approx. Reason., 2008
Eur. J. Oper. Res., 2008
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph.
Eur. J. Oper. Res., 2008
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number.
Discret. Appl. Math., 2008
2007
J. Glob. Optim., 2007
INFORMS J. Comput., 2007
J. Classif., 2007
Proceedings of the Mining and Learning with Graphs, 2007
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
2005
RAIRO Oper. Res., 2005
Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees.
J. Chem. Inf. Model., 2005
Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering.
J. Classif., 2005
Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays.
Asia Pac. J. Oper. Res., 2005
Ann. Oper. Res., 2005
2004
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.
J. Comb. Theory A, 2004
Int. J. Game Theory, 2004
J. Heuristics, 2004
Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.
Discret. Math., 2004
2003
Networks, 2003
Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.
J. Chem. Inf. Comput. Sci., 2003
J. Chem. Inf. Comput. Sci., 2003
2002
J. Glob. Optim., 2002
The maximum capture problem with random utilities: Problem formulation and algorithms.
Eur. J. Oper. Res., 2002
2001
J-M<sub>EANS</sub>: a new local search heuristic for minimum sum of squares clustering.
Pattern Recognit., 2001
J. Chem. Inf. Comput. Sci., 2001
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.
Proceedings of the Graphs and Discovery, 2001
Proceedings of the Graphs and Discovery, 2001
How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process?
Proceedings of the Graphs and Discovery, 2001
2000
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming.
Math. Program., 2000
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.
Oper. Res., 2000
Int. J. Approx. Reason., 2000
Electron. Notes Discret. Math., 2000
Discret. Math., 2000
1999
SIAM J. Sci. Comput., 1999
Math. Program., 1999
Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy.
J. Chem. Inf. Comput. Sci., 1999
Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures.
Discret. Appl. Math., 1999
Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index.
Comput. Chem., 1999
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999
1998
Oper. Res. Lett., 1998
Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming.
Oper. Res., 1998
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem.
Eur. J. Oper. Res., 1998
Proceedings of the Discrete Mathematical Chemistry, 1998
1997
1996
1995
Math. Oper. Res., 1995
J. Chem. Inf. Comput. Sci., 1995
Discret. Appl. Math., 1995
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995
Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1995
1994
J. Glob. Optim., 1994
J. Chem. Inf. Comput. Sci., 1994
J. Chem. Inf. Comput. Sci., 1994
1993
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions.
J. Glob. Optim., 1993
INFORMS J. Comput., 1993
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993
1992
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing.
IEEE Trans. Computers, 1992
SIAM J. Sci. Comput., 1992
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison.
Math. Program., 1992
Math. Program., 1992
J. Glob. Optim., 1992
1991
Math. Program., 1991
Math. Oper. Res., 1991
J. Glob. Optim., 1991
1990
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.
Discret. Appl. Math., 1990
Discret. Appl. Math., 1990
Ann. Math. Artif. Intell., 1990
1989
1988
1986
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities.
Math. Program., 1986
1985
1984
Math. Program., 1984
1983
1980
Oper. Res., 1980
1976
Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations.
Inf. Process. Lett., 1976
Inf. Process. Lett., 1976