Group for Research in Decision Analysis

Publications

Pierre Hansen

Articles

Edge realizability of connected simple graphs
, , , , , and
MATCH Communications in Mathematical and in Computer Chemistry, 78(3), 689–712, 2017 BibTeX reference
Statistical tests of data classifiability with respect to a clustering criterion
, , and
Flogiston, 23, 9–26, 2015 BibTeX reference
MaxMinMin p-dispersion problem: A variable neighborhood search approach
, , and
Computers & Operations Research, 52(Part B), 251–259, 2014 BibTeX reference
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
, , and
Journal of Classification, 31(2), 219–241, 2014 BibTeX reference
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
and
Optimization Letters, 8(3), 903–917, 2014 BibTeX reference
On the Weber facility location problem with limited distances and side constraints
, , , , and
Optimization Letters, 8(2), 407–424, 2014 BibTeX reference
Improving heuristics for network modularity maximization using an exact algorithm
, , and
Discrete Applied Mathematics, 163(1), 65–72, 2014 BibTeX reference
, , , and
Discrete Applied Mathematics, 163(Part 1), 1–2, 2014 BibTeX reference
Two Laplacians for the distance matrix of a graph
and
Linear Algebra and its Applications, 439(1), 21–33, 2013 BibTeX reference
Open problems on graph eigenvalues studied with AutoGraphiX
, , and
EURO Journal on Computational Optimization, 1(1-2), 181–199, 2013 BibTeX reference
On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
, , and
Discrete Applied Mathematics, 161(1-2), 96–106, 2013 BibTeX reference
Refutations, results and conjectures about the Balaban index
, , and
International Journal of Chemical Modeling, 5(2-3), 189–202, 2013 BibTeX reference
A survey of Nordhaus-Gaddum type relations
and
Discrete Applied Mathematics, 161(4-5), 466–546, 2013 BibTeX reference
An improved column generation algorithm for minimum sum-of-squares clustering
, , and
Mathematical Programming, 131(1-2), 195–220, 2012 BibTeX reference
On proper refinement of bimatrix games extreme Nash equilibria
, , and
Automatica, 2(48), 297–303, 2012 BibTeX reference
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
, , and
Computers & Operations Research, 39(11), 2748–2762, 2012 BibTeX reference
The normalized revised Szeged index
and
MATCH, Communications in Mathematical and in Computer Chemistry, 67(2), 369–381, 2012 BibTeX reference
A VNS heuristic for escaping local extrema entrapment in normalized cut clustering
, , and
Pattern Recognition, 45(12), 4337–4345, 2012 BibTeX reference
Algorithm for parametric communities detection in networks
, , and
Physical Review E, 86(1), page 016107, 2012 BibTeX reference
Using size for bounding expressions of graph invariants
, , and
Annals of Operations Research, 188(1), 415–427, 2011 BibTeX reference
The small hexagon and heptagon with maximum sum of distances between vertices
, , , , and
Journal of Global Optimization, 49(3), 467–480, 2011 BibTeX reference
Globally optimal clusterwise regression by mixed logical-quadratic programming
, , and
European Journal of Operational Research, 212(1), 213–222, 2011 BibTeX reference
Comment on "Evolutionary method for finding communities in bipartite networks"
and
Physical Review E, 84(5, article), 2011 BibTeX reference
A new column generation algorithm for logical analysis of data
and
Annals of Operations Research, 188(1), 215–249, 2011 BibTeX reference
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
and
Journal of Global Optimization, 49(3), 449–465, 2011 BibTeX reference
Improving constrained pattern mining with first-fail-based heuristics
, , , and
Data Mining and Knowledge Discovery, 23(1), 63–90, 2011 BibTeX reference
On the extremal values of the second largest Q-eigenvalue
, , and
Linear Algebra and its Applications, 435(10), 2591–2606, 2011 BibTeX reference
Proximity and remoteness in graphs : Results and conjectures
and
Networks, 58(2), 95–102, 2011 BibTeX reference
The mathematics of Peter L. Hammer (1936-2006): Graphs, optimization, and Boolean models
, , , , and
Annals of Operations Research, 188(1), 1–18, 2011 BibTeX reference
Variable neighborhood search for harmonic means clustering
, , , and
Applied Mathematical Modelling, 35(6), 2688–2694, 2011 BibTeX reference
Bounds on the index of the signless Laplacian of a graph
, , , and
Discrete Applied Mathematics, 158(4), 355–360, 2010 BibTeX reference
Nordhaus-Gaddum relations for proximity and remoteness in graphs
and
Computers & Mathematics with Applications, 59(8), 2827–2835, 2010 BibTeX reference
A survey of automated conjectures in spectral graph theory
and
Linear Algebra and its Applications, 432(9), 2293–2322, 2010 BibTeX reference
A sharp upper bound on algebraic connectivity using domination number
, , and
Linear Algebra and its Applications, 432(11), 2879–2893, 2010 BibTeX reference
Bounds and conjectures for the signless Laplacian index of graphs
and
Linear Algebra and its Applications, 432(12), 3319–3336, 2010 BibTeX reference
Comparing Zagreb indices of cyclic graphs
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 63(2), 441–451, 2010 BibTeX reference
Edge ratio and community structure in networks
, , and
Physical Review E, 81(2, article), 14 pages, 2010 BibTeX reference
Loops and multiple edges in modularity maximization of networks
, , and
Physical Review E, 81(4, article), 9 pages, 2010 BibTeX reference
A note on diameters of point sets
, , , and
Optimization Letters, 4(4), 485–495, 2010 BibTeX reference
On a conjecture about the Szeged index
and
European Journal of Combinatorics, 31(7), 1662–1666, 2010 BibTeX reference
Variable neighborhood search for extremal graphs. 24. Conjectures and results about the clique number
, , , and
Studia Informatica Universalis, 8(2), 281–316, 2010 BibTeX reference
Variable neighbourhood search: Methods and applications
, , and
Annals of Operations Research, 175(1), 367–407, 2010 BibTeX reference
Variable neighborhood search for extremal graphs. 17. Further conjectures and results about the index
, , and
Discussiones Mathematicae : Graph Theory, 29, 15–37, 2009 BibTeX reference
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
and
Discrete Applied Mathematics, 157(6), 1267–1290, 2009 BibTeX reference
NP-hardness of euclidean sum-of-squares clustering
, , , and
Machine Learning, 75(2), 245–248, 2009 BibTeX reference
A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
and
Pesquisa Operacional, 29, 503–516, 2009 BibTeX reference
Bounding average distance using order and minimum degree
and
Graph Theory Notes of New York, LVI, 21–29, 2009 BibTeX reference
An inequality for the signless Laplacian index of a graph using the chromatic number
and
Graph Theory Notes of New-York, LVII, 39–42, 2009 BibTeX reference
Locating objects in the plane using global optimization techniques
, , and
Mathematics of Operations Research, 34(4), 837–879, 2009 BibTeX reference
A new sequence form approach for the enumeration of all extreme nash equilibria for extensive form games
, , and
International Game Theory Review, 11(4), 437–451, 2009 BibTeX reference
A note on restarted and modified simplex search for unconstrained optimization
, , , and
Computers & Operations Research, 36(12), 3263–3271, 2009 BibTeX reference
Isoperimetric polygons of maximum width
, , and
Discrete and Computational Geometry, 41(1), 45–60, 2009 BibTeX reference
Ranking small regular polygons by area and by perimeter
, , and
Journal of Applied and Industrial Mathematics, 3(1), 21–27, 2009 BibTeX reference
Recherche à voisinage variable de graphes extrémaux. 26. Nouveaux résultats sur la maille
, , and
RAIRO-Operations Research, 43(4), 339–358, 2009 BibTeX reference
Set covering and packing formulations of graph coloring : Algorithms and first polyhedral results
, , and
Discrete Optimization, 6(2), 135–147, 2009 BibTeX reference
Simple polygons of maximum perimeter contained in a disk of radius one
, , and
Discrete and Computational Geometry, 41(2), 208–215, 2009 BibTeX reference
Solving large p-median clustering problems by primal-dual variable neighborhood search
, , , and
Data Mining and Knowledge Discovery, 19(3), 351–375, 2009 BibTeX reference
Special issue on mathematical contributions to metaheuristics editorial
, , and
Journal of Heuristics, 15(3), 197–199, 2009 BibTeX reference
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
, , and
Discrete Applied Mathematics, 157(17), 3497–3510, 2009 BibTeX reference
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number
and
Discrete Applied Mathematics, 309(13), 4228–4234, 2009 BibTeX reference
Variable neighborhood search for minimum cost berth allocation
, , and
European Journal of Operational Research, 191(3), 636–649, 2008 BibTeX reference
Merging the local and global approaches to probabilistic satisfiability
and
International Journal of Approximate Reasoning, 47(2), 125–140, 2008 BibTeX reference
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
, , , , , , and
European Journal of Operational Research, 191(3), 661–676, 2008 BibTeX reference
Ranking small regular polygons by area and by perimeter
, , and
Diskretnyi Analiz i Issledovanie Operatsii, 15(3), 65–73, 2008 BibTeX reference
Variable neighborhood search for extremal graphs. 25. Products of connectivity and distance measures
, , , and
Graph Theory Notes of New York, 55, 6–13, 2008 BibTeX reference
Complement to a comparative analysis of heuristics for the p-median problem
and
Statistics and Computing, 18(1), 41–46, 2008 BibTeX reference
On bags and bugs
and
Discrete Applied Mathematics, 156(7), 986–997, 2008 BibTeX reference
On the spectral radius of graphs with a given domination number
, , and
Linear Algebra and its Applications, 428(8-9), 1854–1864, 2008 BibTeX reference
The minimum spectral radius of graphics with a given clique number
and
Electronic Journal of Linear Algebra, 17, 110–117, 2008 BibTeX reference
Variable neighborhood search
, , and
European Journal of Operational Research, 191(3), 593–595, 2008 BibTeX reference
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
, , and
Discrete Applied Mathematics, 156(13), 2530–2542, 2008 BibTeX reference
Variable Neighborhood Search for Extremal Graphs. 20. Automated Comparison of Graph Invariants
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 58(2), 365–384, 2007 BibTeX reference
The small octagon with longest perimeter
, , and
Journal of Combinatorial Theory, 114(1), 135–150, 2007 BibTeX reference
Arbitrary-norm hyperplane separation by variable neighborhood search
, , and
IMA Journal of Management Mathematics, 18(2), 173–189, 2007 BibTeX reference
On a conjecture about the Randic index
and
Discrete Applied Mathematics, 307(2), 262–265, 2007 BibTeX reference
Extremal problems for convex polygons
, , and
Journal of Global Optimization, 38(2), 163–179, 2007 BibTeX reference
Variable neighbourhood search for colour image quantization
, , and
IMA Journal of Management Mathematics, 18(2), 207–221, 2007 BibTeX reference
Variable neighborhood search for extremal graphs. 19. Further conjectures and results about the Randic index
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 58(1), 83–102, 2007 BibTeX reference
Algorithms for L1-embeddability and related problems
and
Journal of Classification, 24(2), 251–275, 2007 BibTeX reference
Comparison between Baumann and admissible simplex forms in interval analysis
, , and
Journal of Global Optimization, 37(2), 215–228, 2007 BibTeX reference
Comparing the Zagreb indices
and
Croatica Chemica Acta, 80(2), 165–168, 2007 BibTeX reference
On pitfalls in computing the geodetic number of a graph
and
Optimization Letters, 1(3), 299–307, 2007 BibTeX reference
Variable neighborhood search and local branching
, , and
Computers & Operations Research, 33(10), 3034–3045, 2006 BibTeX reference
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
, , and
Linear Algebra and its Applications, 414(2-3), 407–424, 2006 BibTeX reference
Variable neighborhood search for extremal graphs. 18. Conjectures and results about the Randic index
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 56(3), 541–550, 2006 BibTeX reference
Enumeration of all extreme equilibria in game theory: Bimatrix and polymatrix games
, , and
Journal of Optimization Theory and Applications, 129(3), 349–372, 2006 BibTeX reference
What forms do interesting conjectures have in graph theory?
, , , , and
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 69, 231–252, 2005 BibTeX reference
Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 54, 221–232, 2005 BibTeX reference
Analysis of global k-means an incremental heuristic for minimum sum-of-square clustering
, , , and
Journal of Classification, 22, 287–310, 2005 BibTeX reference
Heuristic procedures for solving the discrete ordered median problem
, , , and
Annals of Operations Research, 136, 145–173, 2005 BibTeX reference
Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical thees
, , and
Journal of Chemical Information and Modeling, 45, 222–230, 2005 BibTeX reference
AutoGraphiX: A Survey
, , , and
Electronic Notes in Discrete Mathematics, 22, 515–520, 2005 BibTeX reference
Recherche à voisinage variable de graphes extrémaux. 13. À propos de la maille
and
RAIRO-Operations Research, 39(4), 275–293, 2005 BibTeX reference
Permutation-based genetic, Tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
, , and
Asia-Pacific Journal of Operational Research, 22(3), 297–326, 2005 BibTeX reference
An exact method for fractional goal programming
, , and
Journal of Global Optimization, 29(1), 113–120, 2004 BibTeX reference
Variable neighborhood search for the maximum clique
, , and
Discrete Applied Mathematics, 145, 117–125, 2004 BibTeX reference
On the geometry of Nash equilibria and correlated equilibria
, , and
International Journal of Game Theory, 32(4), 443–453, 2004 BibTeX reference
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
, , , and
Journal of Combinatorial Theory, Serie A, 108(1), 63–75, 2004 BibTeX reference
On some interconnections between combinatorial optimization and extremal graph theory
, , and
Yugoslav Journal of Operations Research, 14, 147–159, 2004 BibTeX reference
Another trip to the mall: A segmentation study of customers based on their activities
, , and
Journal of Retailing and Consumer Services, 11, 333–350, 2004 BibTeX reference
Improving interval-analysis bounds by translations
, , and
Journal of Global Optimization, 29(2), 157–172, 2004 BibTeX reference
Parallel variable neighborhood search for the p-median
, , , and
Journal of Heuristics, 10, 293–314, 2004 BibTeX reference
Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures
and
Discrete Applied Mathematics, 276(38355), 81–94, 2004 BibTeX reference
Maximum split clustering under connectivity constraints
, , , , and
Journal of Classification, 20(2), 143–180, 2003 BibTeX reference
Graphs with maximum connectivity index
, , , and
Computational Biology and Chemistry, 27(1), 85–90, 2003 BibTeX reference
Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index
and
Journal of Chemical Information and Computer Sciences, 43(1), 1–14, 2003 BibTeX reference
A survey and new results on computer enumeration of polyhex and fusene hydrocarbons
, , and
Journal of Chemical Information and Computer Sciences, 43, 842–851, 2003 BibTeX reference
A note on the smallest eigenvalue of fullerenes
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 48, 37–48, 2003 BibTeX reference
Chemical trees enumeration algorithms
, , and
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 1, 67–83, 2003 BibTeX reference
Identification of all steady-states in large networks by logical analysis
, , and
Bulletin of Mathematical Biology, 65(6), 1025–1051, 2003 BibTeX reference
Local search with alternating neighborhoods (Russian)
, , and
Discrete Analysis and Operations Research, 2(10), 11–43, 2003 BibTeX reference
Solving the p-center problem with Tabu search and variable neighborhood search
, , and
Networks, 42(1), 48–64, 2003 BibTeX reference
Survey and new results on computer enumeration of polyhex and fusene hydrocarbons
, , and
Journal of Chemical Information and Computer Sciences, 43(3), 842–851, 2003 BibTeX reference
Using stable sets to bound the chromatic number
and
Information Processing Letters, 87, 127–131, 2003 BibTeX reference
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses
and
Yugoslav Journal of Operations Research, 12(2), 157–166, 2002 BibTeX reference
Industrial applications of the variable neighborhood search metaheuristic
and
Decision & Control in Management Science, 4, 261–273, 2002 BibTeX reference
Variable Neighborhood Search: Principles and Applications
and
European Journal of Operational Research, 130(3), 449–467, 2001 BibTeX reference
J-MEANS: A New Local Search Heuristic for Minimum Sum-of-Squares Clustering
and
Pattern Recognition, 34(2), page 405-413, 2001 BibTeX reference
Variable neighborhood search for extremal graphs. 8. Variations on graffiti 105
, , and
Congressus Numerantium, 148, 129–144, 2001 BibTeX reference

Books

The mathematics of Peter L. Hammer (1936-2006): Graphs, optimization, and Boolean models
, , , , and
Springer, 188, 2011 BibTeX reference
Data mining and mathematical programming
and
45, American Mathematical Society, Providence, RI, 234 pages, 2008 BibTeX reference
Graphs and discovery
, , , , and
AMS, Providence, RI, 2005 BibTeX reference

Book chapters

Variable neighborhood search survey
and
To appear in: R. Martí, P. Pardalos, M.G.C. Resende (eds.), Handbook of Heuristics, Springer, http://www.springer.com/us/book/9783319071237, 2018 BibTeX reference
Bound constraints for point packing in a square
, , and
L. Adacher et al., CTW11 Proceedings, Università di Roma 3, 126–129, 2011 BibTeX reference
The price of equity in the hazmat transportation problem
, , and
L. Adacher et al., CTW11 Proceedings, Università di Roma 3, 235–238, 2011 BibTeX reference
On the facility location problem with limited distances and side constraints
, , , , and
Proceedings of TOGO 2010, 19–22, 2010 BibTeX reference
Static symmetry breaking in circle packing
, , and
U. Faigle, R. Schrader, D. Herrmann, CTW10 Proceedings, Cologne, 47–50, 2010 BibTeX reference
Variable neighborhood search
, , , and
Handbook of Metaheuristics, Series in Operational Research and Management Science (2nd edition), 146, 61–86, 2010 BibTeX reference
Variable neighborhood search methods
and
C. Floudas, P. Pardalos (eds.), Encyclopedia of Optimization (2nd edition), Springer, 3975–3989, 2009 BibTeX reference
Extremal problems for convex polygons - An update
, , and
Pardalos P.M. & Coleman T.F., Lectures on Global Optimization, 55, 1–16, 2009 BibTeX reference
EM algorithm and variable neighborhood search for fitting finite mixture
, , and
Proceedings of IMCSIT’09, 725–733, 2009 BibTeX reference
Automated results and conjectures on average distance in graph
and
J.A. Bondy, J. Fonlupt, J.L. Fouquet, J.C. Fournier, L. Ramirez-Alfonsin (eds.), Game Theory in Paris: Special Volume in Memory of Claude Berge, 21–36, 2007 BibTeX reference
Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 system
, , , , , , , and
L. Liberty, N. Maculan (eds.), Global Optimization from Theory to Implementation, 84, 231–310, 2006 BibTeX reference
Variable neighbourhood search
and
E. Alba and R. Marti (eds.), Metaheuristic Procedures for Training Neural Networks Series: Operations Research/Computer Science Interfaces Series, 36(4), 71–86, 2006 BibTeX reference
How far is, sould and could be conjecture-making in graph theory an automated process?
Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 189–230, 2005 BibTeX reference
Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity
, , , and
Edited by D. Avis, A. Hertz, O. Marcotte, Graph Theory and Combinatorial Optimization, Kluwer Academic Publishers, 1–16, 2005 BibTeX reference
Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
and
S. Fajtlowicz, P.W. Fowler, P. Hansen, M.F. Janowitz, F.S. Roberts, Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 69, 253–264, 2005 BibTeX reference
Parallel Variable Neighborhood Search
, , and
E. Alba, Parallel Metaheuristics: A New Class of Algorithms, Wiley, 247–266, 2005 BibTeX reference
Exact solution of three nonconvex quadratic programming problems
, , and
C.A. Floudas, P.M. Pardalos (eds.), Frontiers in Global Optimization, Series Nonconvex Optimization and its Applications, 74, Kluwer Academic Publication, 25–43, 2004 BibTeX reference

Proceedings

Finding conjectures in graph theory with AutoGraphiX
, , , , and
Advances in Software Engineering and Systems, Recent Advances in Computer Engineering Series, WSEAS Press, 42–51, 2015 BibTeX reference
Improved method to solve non convex quadratically constrained quadratic problems
, , and
Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 73–76, 2012 BibTeX reference
A column generation heuristic for microdata protection
, , , and
Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 121–124, 2012 BibTeX reference
Branch and bound optimization with heuristics, sequencing and ending subset optimization applied to clusterwise regression
, , and
Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 47–51, 2012 BibTeX reference
A column generation algorithm for semi-supervised minimum sum-of-squares clustering
, , and
Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 19–22, 2012 BibTeX reference
Reformulation of a locally optimal heuristic for modularity maximization
, , and
Proceedings of ROADEF 2012, 2012 BibTeX reference
Modularity clustering on trees
and
Proceedings of ROADEF 2012, Angers, France, 2012 BibTeX reference
Bound constraints for point packing in a square
, , and
CTW11 Proceedings, Università di Roma 3, 126–129, 2011 BibTeX reference
Bruno Simeone's Work in Clustering
CTW11 Proceedings, Università di Roma 3, page 11, 2011 BibTeX reference
The price of equity in the hazmat transportation problem
, , and
CTW11 Proceedings, Università di Roma 3, 235–238, 2011 BibTeX reference
Hierarchical clustering for the identification of communities in networks
, , and
Proceedings of ROADEF 2011, Saint-Étienne, France, 2011 BibTeX reference
Symmetry breaking constraints for the circle packing in a square problem
, , and
Proceedings of ROADEF 2011, Saint-Étienne, France, 2011 BibTeX reference
Formulation symmetries in circle packing
, , and
ISCO Proceedings, Electronic Notes in Discrete Mathematics, 36, 1303–1310, 2010 BibTeX reference
Lower bounds for the uncapacitated facility location problem with user preferences
, , and
Proceedings of 2nd International Workshop Discrete Optimization Methods in Production and Logistics, 50–55, 2004 BibTeX reference