Groupe d’études et de recherche en analyse des décisions

Publications

Pierre Hansen

Articles

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

Livres

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

Chapitres de livre

Variable neighborhood search survey
et
À paraître dans : R. Martí, P. Pardalos, M.G.C. Resende (eds.), Handbook of Heuristics, Springer, http://www.springer.com/us/book/9783319071237, 2018 référence BibTeX
Bound constraints for point packing in a square
, et
L. Adacher et al., CTW11 Proceedings, Università di Roma 3, 126–129, 2011 référence BibTeX
The price of equity in the hazmat transportation problem
, et
L. Adacher et al., CTW11 Proceedings, Università di Roma 3, 235–238, 2011 référence BibTeX
On the facility location problem with limited distances and side constraints
, , , et
Proceedings of TOGO 2010, 19–22, 2010 référence BibTeX
Static symmetry breaking in circle packing
, et
U. Faigle, R. Schrader, D. Herrmann, CTW10 Proceedings, Cologne, 47–50, 2010 référence BibTeX
Variable neighborhood search methods
et
C. Floudas, P. Pardalos (eds.), Encyclopedia of Optimization (2nd edition), Springer, 3975–3989, 2009 référence BibTeX
Extremal problems for convex polygons - An update
, et
Pardalos P.M. & Coleman T.F., Lectures on Global Optimization, 55, 1–16, 2009 référence BibTeX
EM algorithm and variable neighborhood search for fitting finite mixture
, et
Proceedings of IMCSIT’09, 725–733, 2009 référence BibTeX
Automated results and conjectures on average distance in graph
et
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 référence BibTeX
Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 system
, , , , , , et
L. Liberty, N. Maculan (eds.), Global Optimization from Theory to Implementation, 84, 231–310, 2006 référence BibTeX
Variable neighbourhood search
et
E. Alba and R. Marti (eds.), Metaheuristic Procedures for Training Neural Networks Series: Operations Research/Computer Science Interfaces Series, 36(4), 71–86, 2006 référence BibTeX
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 référence BibTeX
Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity
, , et
Edited by D. Avis, A. Hertz, O. Marcotte, Graph Theory and Combinatorial Optimization, Kluwer Academic Publishers, 1–16, 2005 référence BibTeX
Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
et
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 référence BibTeX
Parallel Variable Neighborhood Search
, et
E. Alba, Parallel Metaheuristics: A New Class of Algorithms, Wiley, 247–266, 2005 référence BibTeX
Exact solution of three nonconvex quadratic programming problems
, et
C.A. Floudas, P.M. Pardalos (eds.), Frontiers in Global Optimization, Series Nonconvex Optimization and its Applications, 74, Kluwer Academic Publication, 25–43, 2004 référence BibTeX

Actes de conférence

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