Pierre Hansen

According to our database1, Pierre Hansen authored at least 228 papers between 1976 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Integral simplex using double decomposition for set partitioning problems.
Comput. Oper. Res., 2019

2018
Variable Neighborhood Search.
Proceedings of the Handbook of Heuristics., 2018

On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs.
Discret. Appl. Math., 2018

Cospectrality of graphs with respect to distance matrices.
Appl. Math. Comput., 2018

On the k-Medoids Model for Semi-supervised Clustering.
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

New VNP for automatic programming.
Electron. Notes Discret. Math., 2017

On the nullity number of graphs.
Electron. J. Graph Theory Appl., 2017

Variable neighborhood search: basics and variants.
EURO J. Comput. Optim., 2017

The geometric-arithmetic index and the chromatic number of connected graphs.
Discret. Appl. Math., 2017

Proximity, remoteness and girth in graphs.
Discret. Appl. Math., 2017

2016
Proximity, remoteness and distance eigenvalues of a graph.
Discret. Appl. Math., 2016

2015
Community detection with the weighted parsimony criterion.
J. Syst. Sci. Complex., 2015

New heuristic for harmonic means clustering.
J. Glob. Optim., 2015

Adding cohesion constraints to models for modularity maximization in networks.
J. Complex Networks, 2015

A reliable affine relaxation method for global optimization.
4OR, 2015

2014
Variable Neighborhood Search for Edge-Ratio Network Clustering.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

On the Weber facility location problem with limited distances and side constraints.
Optim. Lett., 2014

A locally optimal hierarchical divisive heuristic for bipartite modularity maximization.
Optim. Lett., 2014

Column generation bounds for numerical microaggregation.
J. Glob. Optim., 2014

Global optimization workshop 2012.
J. Glob. Optim., 2014

Editorial.
Discret. Appl. Math., 2014

Automated generation of conjectures on forbidden subgraph characterization.
Discret. Appl. Math., 2014

Improving heuristics for network modularity maximization using an exact algorithm.
Discret. Appl. Math., 2014

MaxMinMin p-dispersion problem: A variable neighborhood search approach.
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

Reformulation of a model for hierarchical divisive graph modularity maximization.
Ann. Oper. Res., 2014

2013
Open problems on graph eigenvalues studied with AutoGraphiX.
EURO J. Comput. Optim., 2013

The Small Octagons of Maximal Width.
Discret. Comput. Geom., 2013

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square.
Discret. Appl. Math., 2013

A survey of Nordhaus-Gaddum type relations.
Discret. Appl. Math., 2013

Sequential clustering with radius and split criteria.
Central Eur. J. Oper. Res., 2013

2012
A VNS heuristic for escaping local extrema entrapment in normalized cut clustering.
Pattern Recognit., 2012

An improved column generation algorithm for minimum sum-of-squares clustering.
Math. Program., 2012

Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression.
Comput. Oper. Res., 2012

On proper refinement of Nash equilibria for bimatrix games.
Autom., 2012

Compact Relaxations for Polynomial Programming Problems.
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

Modularity maximization in networks by variable neighborhood search.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

2011
Proximity and remoteness in graphs: Results and conjectures.
Networks, 2011

Remarks on solutions to a nonconvex quadratic programming test problem.
J. Glob. Optim., 2011

The small hexagon and heptagon with maximum sum of distances between vertices.
J. Glob. Optim., 2011

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering.
J. Glob. Optim., 2011

Globally optimal clusterwise regression by mixed logical-quadratic programming.
Eur. J. Oper. Res., 2011

Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov., 2011

Maximizing edge-ratio is NP-complete.
Discret. Appl. Math., 2011

Using size for bounding expressions of graph invariants.
Ann. Oper. Res., 2011

A new column generation algorithm for Logical Analysis of Data.
Ann. Oper. Res., 2011

The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011

The price of equity in the Hazmat.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Bruno Simeone's Work in Clustering.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Bound constraints for Point Packing in a Square.
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

A note on diameters of point sets.
Optim. Lett., 2010

Exact and heuristic solutions of the global supply chain problem with transfer pricing.
Eur. J. Oper. Res., 2010

Formulation symmetries in circle packing.
Electron. Notes Discret. Math., 2010

On a conjecture about the Szeged index.
Eur. J. Comb., 2010

Bounds on the index of the signless Laplacian of a graph.
Discret. Appl. Math., 2010

Nordhaus-Gaddum relations for proximity and remoteness in graphs.
Comput. Math. Appl., 2010

Variable neighbourhood search: methods and applications.
Ann. Oper. Res., 2010

Attraction probabilities in variable neighborhood search.
4OR, 2010

Static Symmetry Breaking in Circle Packing.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Variable Neighborhood Search Methods.
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

Locating Objects in the Plane Using Global Optimization Techniques.
Math. Oper. Res., 2009

NP-hardness of Euclidean sum-of-squares clustering.
Mach. Learn., 2009

Average distance and maximum induced forest.
J. Graph Theory, 2009

A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games.
IGTR, 2009

Special issue on mathematical contributions to metaheuristics editorial.
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

Simple Polygons of Maximum Perimeter Contained in a Unit Disk.
Discret. Comput. Geom., 2009

Isoperimetric Polygons of Maximum Width.
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

A restarted and modified simplex search for unconstrained optimization.
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
Complement to a comparative analysis of heuristics for the <i>p</i> -median problem.
Stat. Comput., 2008

Exact <i>L</i> <sub>2</sub>-norm plane separation.
Optim. Lett., 2008

The maximum return-on-investment plant location problem with market share.
J. Oper. Res. Soc., 2008

Merging the local and global approaches to probabilistic satisfiability.
Int. J. Approx. Reason., 2008

Variable neighborhood search for minimum cost berth allocation.
Eur. J. Oper. Res., 2008

Variable neighborhood search.
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
On pitfalls in computing the geodetic number of a graph.
Optim. Lett., 2007

Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis.
J. Glob. Optim., 2007

Extremal problems for convex polygons.
J. Glob. Optim., 2007

The small octagon with longest perimeter.
J. Comb. Theory, Ser. A, 2007

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
INFORMS J. Comput., 2007

The p-median problem: A survey of metaheuristic approaches.
Eur. J. Oper. Res., 2007

On a conjecture about the Randic index.
Discret. Math., 2007

Algorithms for <i>l</i><sub>1</sub>-Embeddability and Related Problems.
J. Classif., 2007

Improving Frequent Subgraph Mining in the Presence of Symmetry.
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
A note on duality gap in the simple plant location problem.
Eur. J. Oper. Res., 2006

First vs. best improvement: An empirical study.
Discret. Appl. Math., 2006

Variable neighborhood search and local branching.
Comput. Oper. Res., 2006

2005
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille.
RAIRO Oper. Res., 2005

Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees.
J. Chem. Inf. Model., 2005

On bags and bugs.
Electron. Notes Discret. Math., 2005

AutoGraphiX: a survey.
Electron. Notes Discret. Math., 2005

On uniform <i>k</i>-partition problems.
Discret. Appl. Math., 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

Heuristic Procedures for Solving the Discrete Ordered Median Problem.
Ann. Oper. Res., 2005

Variations on the Roy-Gallai theorem.
4OR, 2005

2004
Pooling Problem: Alternate Formulations and Solution Methods.
Manag. Sci., 2004

Improving Interval Analysis Bounds by Translations.
J. Glob. Optim., 2004

An Exact Method for Fractional Goal Programming.
J. Glob. Optim., 2004

The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.
J. Comb. Theory, Ser. A, 2004

On the geometry of Nash equilibria and correlated equilibria.
Int. J. Game Theory, 2004

Cooperative Parallel Variable Neighborhood Search for the <i>p</i>-Median.
J. Heuristics, 2004

Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.
Discret. Math., 2004

Variable neighborhood search for the maximum clique.
Discret. Appl. Math., 2004

2003
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search.
Networks, 2003

Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.
J. Chem. Inf. Comput. Sci., 2003

A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons.
J. Chem. Inf. Comput. Sci., 2003

Using stable sets to bound the chromatic number.
Inf. Process. Lett., 2003

An Oil Pipeline Design Problem.
Oper. Res., 2003

Maximum Split Clustering Under Connectivity Constraints.
J. Classif., 2003

Graphs with maximum connectivity index.
Comput. Biol. Chem., 2003

Búsqueda de Entorno Variable.
Inteligencia Artif., 2003

Chemical trees enumeration algorithms.
4OR, 2003

2002
Fuzzy J-Means: a new heuristic for fuzzy clustering.
Pattern Recognit., 2002

A note on reduction of quadratic and bilinear programs with equality constraints.
J. Glob. Optim., 2002

The Largest Small Octagon.
J. Comb. Theory, Ser. A, 2002

A constructive enumeration of fusenes and benzenoids.
J. Algorithms, 2002

Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb., 2002

The maximum capture problem with random utilities: Problem formulation and algorithms.
Eur. J. Oper. Res., 2002

Polynomial algorithms for nested univariate clustering.
Discret. Math., 2002

Boundary uniqueness of fusenes.
Discret. Appl. Math., 2002

2001
Enumeration of All Extreme Equilibria of Bimatrix Games.
SIAM J. Sci. Comput., 2001

J-M<sub>EANS</sub>: a new local search heuristic for minimum sum of squares clustering.
Pattern Recognit., 2001

A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees.
J. Chem. Inf. Comput. Sci., 2001

Variable Neighborhood Decomposition Search.
J. Heuristics, 2001

Variable neighborhood search: Principles and applications.
Eur. J. Oper. Res., 2001

Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.
Proceedings of the Graphs and Discovery, 2001

What Forms Do Interesting Conjectures Have in Graph Theory?
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

Probabilistic satisfiability with imprecise probabilities.
Int. J. Approx. Reason., 2000

AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory.
Electron. Notes Discret. Math., 2000

Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system.
Discret. Math., 2000

1999
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering.
SIAM J. Sci. Comput., 1999

A symmetrical linear maxmin approach to disjoint bilinear programming.
Math. Program., 1999

Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy.
J. Chem. Inf. Comput. Sci., 1999

The Assignment Problem with Seniority and Job Priority Constraints.
Oper. Res., 1999

Nash Equilibria from the Correlated Equilibria Viewpoint.
IGTR, 1999

Stabilized column generation.
Discret. Math., 1999

Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures.
Discret. Appl. Math., 1999

On Lower Bounds for Numbered Complete Graphs.
Discret. Appl. Math., 1999

Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index.
Comput. Chem., 1999

On the Relations between Probabilistic Logic and p-CMS.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Finding Relations in Polynomial Time.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998
Heuristic solution of the multisource Weber problem as a p-median problem.
Oper. Res. Lett., 1998

Enumeration of Polyhex Hydrocarbons to h = 21.
J. Chem. Inf. Comput. Sci., 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

Enumeration of fusenes to <i>h</i> = 20.
Proceedings of the Discrete Mathematical Chemistry, 1998

1997
Cluster analysis and mathematical programming.
Math. Program., 1997

Mixed graph colorings.
Math. Methods Oper. Res., 1997

Perfect matchings and ears in elementary bipartite graphs.
Discret. Math., 1997

Splitting trees.
Discret. Math., 1997

Paths with Minimum Range and Ratio of Arc Lengths.
Discret. Appl. Math., 1997

Variable neighborhood search.
Comput. Oper. Res., 1997

1996
An Impossibility Result in Axiomatic Location Theory.
Math. Oper. Res., 1996

Shortest Shortest Path Trees of a Network.
Discret. Appl. Math., 1996

Heuristic reliability optimization by tabu search.
Ann. Oper. Res., 1996

Nesticity.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1995
Complexity of Product Positioning and Ball Intersection Problems.
Math. Oper. Res., 1995

Finding a Kekule Structure in a Benzenoid System in Linear Time.
J. Chem. Inf. Comput. Sci., 1995

Boole's Conditions of Possible Experience and Reasoning under Uncertainty.
Discret. Appl. Math., 1995

Assigning a Kekulé Structure to a Conjugated Molecule.
Comput. Chem., 1995

Models and Algorithms for Probabilistic and Bayesian Logic.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Probabilistic Satisfiability and Decomposition.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1995

1994
Finding maximum likelihood estimators for the three-parameter Weibull distribution.
J. Glob. Optim., 1994

Numerical Bounds for the Perfect Matching Vectors of a Polyhex.
J. Chem. Inf. Comput. Sci., 1994

Bonds Fixed by Fixing Bonds.
J. Chem. Inf. Comput. Sci., 1994

Coding Chemical Trees with the Centered N-tuple Code.
J. Chem. Inf. Comput. Sci., 1994

1993
Sharp bounds on the order, size, and stability number of graphs.
Networks, 1993

Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions.
J. Glob. Optim., 1993

State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming.
INFORMS J. Comput., 1993

A linear algorithm for perfect matching in hexagonal systems.
Discret. Math., 1993

Bounded vertex colorings of graphs.
Discret. Math., 1993

How to Choose K Entities Among N.
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993

A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs.
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

New Branch-and-Bound Rules for Linear Bilevel Programming.
SIAM J. Sci. Comput., 1992

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison.
Math. Program., 1992

Global optimization of univariate Lipschitz functions: I. Survey and properties.
Math. Program., 1992

Reduction of indefinite quadratic programs to bilinear programs.
J. Glob. Optim., 1992

1991
Detection of spurious states of neural networks.
IEEE Trans. Neural Networks, 1991

On-line and off-line vertex enumeration by adjacency lists.
Oper. Res. Lett., 1991

An analytical approach to global optimization.
Math. Program., 1991

Hyperbolic 0-1 programming and query optimization in information retrieval.
Math. Program., 1991

On the Number of Iterations of Piyavskii's Global Optimization Algorithm.
Math. Oper. Res., 1991

On Timonov's algorithm for global optimization of univariate Lipschitz functions.
J. Glob. Optim., 1991

Column Generation Methods for Probabilistic Logic.
INFORMS J. Comput., 1991

The smallest hard-to-color graph.
Discret. Math., 1991

The continuous center set of a network.
Discret. Appl. Math., 1991

Acknowledgement.
Discret. Appl. Math., 1991

1990
Commuters' Paths with Penalties for Early or Late Arrival Time.
Transp. Sci., 1990

Preface.
Discret. Appl. Math., 1990

On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization.
Discret. Appl. Math., 1990

The basic algorithm for pseudo-Boolean programming revisited.
Discret. Appl. Math., 1990

Algorithms for the maximum satisfiability problem.
Computing, 1990

Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem.
Ann. Math. Artif. Intell., 1990

1989
The continuous <i>p</i>-median of a network.
Networks, 1989

1988
Algorithms for Voting and Competitive Location on a Network.
Transp. Sci., 1988

1986
Efficient points on a network.
Networks, 1986

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities.
Math. Program., 1986

Equivalence of Solutions to Network Location Problems.
Math. Oper. Res., 1986

Unimodular functions.
Discret. Appl. Math., 1986

1985
The Minisum and Minimax Location Problems Revisited.
Oper. Res., 1985

Uniquely solvable quadratic boolean equations.
Discret. Appl. Math., 1985

1984
Roof duality, complementation and persistency in quadratic 0-1 optimization.
Math. Program., 1984

1983
Recognizing sign solvable graphs.
Discret. Appl. Math., 1983

1980
Bicriterion Cluster Analysis.
IEEE Trans. Pattern Anal. Mach. Intell., 1980

Technical Note - Location Theory, Dominance, and Convexity: Some Further Results.
Oper. Res., 1980

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

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

A Cascade Algorithm for the Logical Closure of a Set of Binary Relations.
Inf. Process. Lett., 1976

Degrees and independent sets of hypergraphs.
Discret. Math., 1976


  Loading...