Pierre Hansen
#96,821
Most Influential Person Now
Pierre Hansen's AcademicInfluence.com Rankings
Pierre Hansenmathematics Degrees
Mathematics
#4747
World Rank
#6728
Historical Rank
Operations Research
#24
World Rank
#24
Historical Rank
Measure Theory
#465
World Rank
#661
Historical Rank

Download Badge
Mathematics
Why Is Pierre Hansen Influential?
(Suggest an Edit or Addition)Pierre Hansen's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Variable neighborhood search (1997) (4286)
- Variable neighborhood search: Principles and applications (1998) (1905)
- NP-hardness of Euclidean sum-of-squares clustering (2008) (940)
- New Branch-and-Bound Rules for Linear Bilevel Programming (1989) (698)
- Variable neighbourhood search: methods and applications (2008) (590)
- Bicriterion Path Problems (1980) (555)
- Variable neighbourhood search: methods and applications (2010) (462)
- Variable Neighbourhood Search (2003) (446)
- The p-median problem: A survey of metaheuristic approaches (2005) (430)
- Variable neighborhood search for the p-median (1997) (427)
- Cluster analysis and mathematical programming (1997) (416)
- Stabilized column generation (1998) (402)
- An Introduction to Variable Neighborhood Search (1997) (389)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (1984) (344)
- Variable Neighborhood Decomposition Search (1998) (333)
- Essays and Surveys in Metaheuristics (2002) (318)
- Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index (1998) (258)
- J-MEANS: a new local search heuristic for minimum sum of squares clustering (1999) (256)
- Distance spectra of graphs: A survey (2013) (250)
- Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem (2000) (244)
- Algorithms for the maximum satisfiability problem (1987) (232)
- Variable neighborhood search: basics and variants (2017) (228)
- Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system (1997) (215)
- Two Laplacians for the distance matrix of a graph (2011) (200)
- Variable neighborhood search for minimum cost berth allocation (2003) (200)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming (1997) (199)
- Variable neighborhood search and local branching (2004) (186)
- Cooperative Parallel Variable Neighborhood Search for the p-Median (2004) (185)
- Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search (2000) (181)
- Methods of Nonlinear 0-1 Programming (1979) (178)
- A survey of Nordhaus-Gaddum type relations (2010) (175)
- Graphs with maximum connectivity index (2001) (171)
- Pooling Problem: Alternate Formulations and Solution Methods (2000) (160)
- Product selection and space allocation in supermarkets (1979) (153)
- Variable Neighborhood Search: Methods and Applications (2008) (151)
- Column Generation Methods for Probabilistic Logic (1989) (148)
- Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy (1998) (147)
- Another trip to the mall: a segmentation study of customers based on their activities (2004) (144)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (2014) (141)
- Links Between Linear Bilevel and Mixed 0–1 Programming Problems (1995) (140)
- A Plant and Warehouse Location Problem (1977) (138)
- Complete-Link Cluster Analysis by Graph Coloring (1978) (132)
- Column generation algorithms for exact modularity maximization in networks. (2010) (131)
- Heuristic solution of the multisource Weber problem as a p-median problem (1996) (125)
- Developments of Variable Neighborhood Search (2002) (124)
- A heuristic solution to the warehouse location-routing problem (1994) (123)
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering (1997) (119)
- Bicriterion Cluster Analysis (1980) (118)
- The maximum capture problem with random utilities: Problem formulation and algorithms (2002) (117)
- A Tutorial on Variable Neighborhood Search (2003) (112)
- Constrained Nonlinear 0-1 Programming (1989) (112)
- First vs. best improvement: An empirical study (1999) (106)
- Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures (2000) (104)
- The Minisum and Minimax Location Problems Revisited (1985) (103)
- Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison (1989) (102)
- Variable neighborhood search for the maximum clique (2001) (102)
- A Survey of Solution Methods for the Continuous Location-Allocation Problem (2007) (98)
- Variable Neighborhood Search for Extremal Graphs 14: The AutoGraphiX 2 System (2006) (97)
- An improved column generation algorithm for minimum sum-of-squares clustering (2009) (95)
- Fuzzy J-Means: a new heuristic for fuzzy clustering (2001) (92)
- Improvements and Comparison of Heuristics for solving the Multisource Weber Problem (1997) (91)
- Outcomes of voting and planning: Condorcet, Weber and Rawls locations (1981) (90)
- On-line and off-line vertex enumeration by adjacency lists (1990) (87)
- Global optimization of univariate Lipschitz functions: I. Survey and properties (1989) (83)
- Essays and surveys in global optimization (2005) (82)
- Identification of all steady states in large networks by logical analysis (2003) (82)
- The basic algorithm for pseudo-Boolean programming revisited (1988) (82)
- Comparing the Zagreb Indices (2007) (81)
- Alkanes with small and large Randić connectivity indices (1999) (79)
- Uncapacitated plant location under alternative spatial price policies (1990) (78)
- Technical Note - Location Theory, Dominance, and Convexity: Some Further Results (1980) (78)
- The Assignment Problem with Seniority and Job Priority Constraints (1995) (77)
- Solving large p-median clustering problems by primal–dual variable neighborhood search (2009) (75)
- State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming (1993) (74)
- Variable Neighborhood Search Methods (2007) (72)
- An analytical approach to global optimization (1991) (71)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (2010) (71)
- Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees (2003) (69)
- Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering (2005) (67)
- A reliable affine relaxation method for global optimization (2010) (67)
- Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index (2001) (66)
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem (2003) (65)
- Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph (2001) (65)
- Some properties of the distance Laplacian eigenvalues of a graph (2013) (65)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (1982) (64)
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming (1992) (64)
- WEBER'S PROBLEM WITH ATTRACTION AND REPULSION (1991) (64)
- An Oil Pipeline Design Problem (2000) (63)
- Hyperbolic 0–1 programming and query optimization in information retrieval (1990) (63)
- A survey of automated conjectures in spectral graph theory (2009) (62)
- On a conjecture about the Szeged index (2009) (62)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (2005) (61)
- Bounded vertex colorings of graphs (1990) (60)
- Sensitivity analysis in multiple objective linear programming: The tolerance approach (1989) (58)
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (2015) (57)
- On bags and bugs (2005) (56)
- Best network flow bounds for the quadratic knapsack problem (1989) (56)
- A symmetrical linear maxmin approach to disjoint bilinear programming (1996) (56)
- Probabilistic satisfiability with imprecise probabilities (1999) (56)
- Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex (2007) (55)
- Facility location analysis (1987) (55)
- Bounds and conjectures for the signless Laplacian index of graphs (2009) (54)
- Locally optimal heuristic for modularity maximization of networks. (2011) (54)
- Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing (1992) (54)
- Fullerene isomers of C60. Kekulé counts versus stability (1994) (54)
- Mixed graph colorings (1995) (53)
- Variable Neighborhood Search for Extremal Graphs. 20. Automated Comparison of Graph Invariants (2005) (52)
- Global minimization of indefinite quadratic functions subject to box constraints (1991) (52)
- Minimum sum of diameters clustering (1987) (52)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (2005) (51)
- Extremal problems for convex polygons (2005) (51)
- Minimum Sum of Squares Clustering in a Low Dimensional Space (1996) (50)
- The Largest Small Octagon (2001) (48)
- Proximity and remoteness in graphs: Results and conjectures (2011) (47)
- Algorithms for Voting and Competitive Location on a Network (1988) (46)
- Comparing Zagreb Indices of Cyclic Graphs (2009) (46)
- Distance Matrices, Wiener Indices, and Related Invariants of Fullerenes (2001) (46)
- Heuristic Procedures for Solving the Discrete Ordered Median Problem (2005) (46)
- Attraction probabilities in variable neighborhood search (2010) (45)
- Modularity maximization in networks by variable neighborhood search (2011) (45)
- On the spectral radius of graphs with a given domination number (2007) (45)
- On the distance signless Laplacian of a graph (2014) (44)
- Loops and multiple edges in modularity maximization of networks. (2009) (44)
- Location and sizing of offshore platforms for oil exploration (1992) (44)
- An Algorithm for a Constrained Weber Problem (1982) (43)
- Globally optimal clusterwise regression by mixed logical-quadratic programming (2010) (43)
- Models and Algorithms for Probabilistic and Bayesian Logic (1995) (43)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (2006) (42)
- Commuters' Paths with Penalties for Early or Late Arrival Time (1990) (40)
- The Clar number of a benzenoid hydrocarbon and linear programming (1994) (40)
- Merging the local and global approaches to probabilistic satisfiability (2004) (40)
- Unimodular functions (1986) (39)
- On a conjecture about the Randic index (2005) (39)
- Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences (2004) (38)
- Decomposition Strategies for Large Scale Continuous Location-Allocation Problems (2004) (38)
- THE MINIMUM SPECTRAL RADIUS OF GRAPHS WITH A GIVEN CLIQUE NUMBER (2007) (37)
- Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number (2006) (37)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (2008) (36)
- A Note on Formulations of Static and Dynamic Berth Allocation Problems (2003) (36)
- Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index (2009) (36)
- Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays (2004) (34)
- Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games (2003) (34)
- Enumeration of All Extreme Equilibria of Bimatrix Games (1996) (34)
- Variable Neighborhood Search for Extremal Graphs. 19. Further Conjectures and Results about the Randic Index (2006) (34)
- Boole's Conditions of Possible Experience and Reasoning under Uncertainty (1992) (33)
- Reduction of indefinite quadratic programs to bilinear programs (1992) (33)
- A restarted and modified simplex search for unconstrained optimization (2009) (33)
- Automated Results and Conjectures on Average Distance in Graphs (2006) (32)
- Upper bounds for the Clar number of a benzenoid hydrocarbon (1992) (32)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (1986) (32)
- The small octagon with longest perimeter (2005) (32)
- Improving heuristics for network modularity maximization using an exact algorithm (2011) (32)
- Facility location under zone pricing (1997) (31)
- Polyenes with maximum HOMO–LUMO gap ☆ (2001) (31)
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm (1988) (31)
- Single Facility Location on Networks (1987) (30)
- Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm) (1985) (30)
- On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square (2011) (30)
- Boundary uniqueness of fusenes (1999) (29)
- A linear algorithm for perfect matching in hexagonal systems (1993) (29)
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs (2017) (29)
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (2011) (29)
- Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity (2004) (28)
- Discrete Mathematical Chemistry (2000) (28)
- Equivalence of Solutions to Network Location Problems (1986) (28)
- Constrained Location and the Weber-Rawls Problem (1981) (28)
- Bonds Fixed by Fixing Bonds (1993) (27)
- Large - Eddy Simulation of a Circular Cylinder on Unstructured Grids (2002) (26)
- Dispersing Facilities on a Network (1995) (26)
- A constructive enumeration of fusenes and benzenoids (2001) (26)
- Trees with Palindromic Hosoya Polynomials (1999) (26)
- Facts and Conjectures about Fullerene Graphs: Leapfrog, Cylinder and Ramanujan Fullerenes (2001) (26)
- Reformulation of a model for hierarchical divisive graph modularity maximization (2012) (25)
- Edge ratio and community structure in networks. (2009) (25)
- On using estimates of Lipschitz constants in global optimization (1990) (25)
- Systems of Cities and Facility Location (2002) (25)
- Variable Neighborhood Search for Extremal Graphs 8: Variations on Graffiti 105 (2001) (25)
- Enumeration of Polyhex Hydrocarbons to h = 21 (1998) (24)
- Global Optimization in Location (1995) (24)
- Kekule Count in Tubular Hydrocarbons (1994) (24)
- On the extremal values of the second largest Q-eigenvalue (2010) (24)
- Partitioning Problems in Cluster Analysis: A Review of Mathematical Programming Approaches (1994) (24)
- Simple plant location under uniform delivered pricing (1981) (24)
- Formulation symmetries in circle packing (2010) (24)
- Parallel Variable Neighborhood Search (2004) (24)
- Locating Objects in the Plane Using Global Optimization Techniques (2009) (23)
- Variable Neighborhood Search for Extremal Graphs. 12. A Note on the Variance of Bounded Degrees in Graphs (2004) (23)
- Finding Relations in Polynomial Time (1999) (23)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (2003) (23)
- Boolean query optimization and the 0-1 hyperbolic sum problem (1990) (22)
- Maximizing the Product of Two Linear Functions In 0-1 Variables (2002) (22)
- Variable neighborhood search for harmonic means clustering (2009) (22)
- Finding maximum likelihood estimators for the three-parameter Weibull distribution (1994) (22)
- Cospectrality of graphs with respect to distance matrices (2016) (22)
- The simple plant location problem (1976) (22)
- A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons (2002) (22)
- Enumeration of Polyhex Hydrocarbons to h = 21. (1997) (20)
- The profit-maximizing weber problem (1994) (20)
- Extremal Problems for Convex Polygons - An Update (2007) (20)
- On the Complexity of Minimum Sum-of-Squares Clustering (2007) (20)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (1991) (20)
- Procedures for the reduction of errors in road network data (1974) (20)
- An Inequality for the Signless Laplacian Index of a Graph Using the Chromatic Number (2009) (19)
- A new column generation algorithm for Logical Analysis of Data (2009) (19)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (2012) (19)
- Variable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures (2007) (19)
- Proximity, remoteness and distance eigenvalues of a graph (2014) (19)
- Variable Neighborhood Search for Least Squares Clusterwise Regression (2005) (19)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (2006) (18)
- Arbitrary-Norm Hyperplane Separation by Variable Neighborhood Search (2005) (18)
- What Forms Do Interesting Conjectures Have in Graph Theory? (2001) (18)
- A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming (2000) (18)
- Some Further Results on Monotonicity in Globally Optimal Design (1988) (17)
- Isoperimetric Polygons of Maximum Width (2009) (17)
- The boundary-edges code for polyhexes (1994) (17)
- Graphs and Discovery (2007) (17)
- Chemical trees enumeration algorithms (1999) (17)
- Graph colouring and applications (1999) (17)
- Maximum Split Clustering Under Connectivity Constraints (1993) (17)
- A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees (1999) (17)
- A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering (2008) (17)
- A note on duality gap in the simple plant location problem (2002) (17)
- Computers and discovery in algebraic graph theory (2001) (16)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (1992) (16)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (2005) (16)
- Uniquely solvable quadratic boolean equations (1985) (16)
- Splitting trees (1997) (16)
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (1990) (16)
- Integral complete split graphs (2002) (16)
- Distance Laplacian Eigenvalues and Chromatic Number in Graphs (2016) (16)
- How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? (2001) (16)
- Improving Interval Analysis Bounds by Translations (2004) (15)
- UPPER PLANES OF QUADRATIC 0–1 FUNCTIONS AND STABILITY IN GRAPHS (1981) (15)
- How to Choose K Entities Among N (1994) (15)
- Coding Chemical Trees with the Centered N-tuple Code (1994) (14)
- On proper refinement of Nash equilibria for bimatrix games (2012) (14)
- Normal components of benzenoid systems (1993) (14)
- On some interconnections between combinatorial optimization and extremal graph theory (2004) (14)
- Sharp bounds on the order, size, and stability number of graphs (1992) (14)
- Complement to a comparative analysis of heuristics for the p-median problem (2007) (14)
- An introduction to the ELECTRE research programme (1983) (14)
- A VNS heuristic for escaping local extrema entrapment in normalized cut clustering (2012) (14)
- An Impossibility Result in Axiomatic Location Theory (1996) (13)
- Heuristic reliability optimization by tabu search (1996) (13)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (2009) (13)
- Quasi-Kernels of Outranking Relations (1976) (13)
- Computers in Graph Theory (2002) (13)
- Variable Neighbourhood Search for Maximum Weight Satisfiability Problem (2000) (13)
- MaxMinMin p-dispersion problem: A variable neighborhood search approach (2014) (13)
- A Framework for Algorithms in Globally Optimal Design (1988) (13)
- Average-Linkage Divisive Hierarchical Clustering (1991) (13)
- C60Br24 as a chemical illustration of graph theoretical independence (1998) (13)
- Cord-slope form of Taylor's expansion in univariate global optimization (1991) (13)
- Algorithm for parametric community detection in networks. (2012) (13)
- Average distance and maximum induced forest (2009) (13)
- Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures (1994) (12)
- Finding communities in networks in the strong and almost-strong sense. (2011) (12)
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs (2017) (12)
- AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory (2000) (12)
- Nash Equilibria from the Correlated Equilibria Viewpoint (1997) (12)
- The continuous center set of a network (1991) (12)
- Modelling location and sizing of offshore platforms (1994) (12)
- A sharp upper bound on algebraic connectivity using domination number (2009) (12)
- An algorithm for Weber's problem on the sphere (1994) (12)
- Proximity, remoteness and girth in graphs (2009) (12)
- A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games (2006) (11)
- On Timonov's algorithm for global optimization of univariate Lipschitz functions (1990) (11)
- Exact L2-norm plane separation (2007) (11)
- New heuristic for harmonic means clustering (2015) (11)
- On the Weber facility location problem with limited distances and side constraints (2011) (11)
- Variable Neighborhood Search: A Chapter of Handbook of Applied Optimization (2000) (11)
- Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations (1976) (11)
- Global minimization of univariate functions by sequential polynomial approximation (1988) (11)
- Sequential clustering with radius and split criteria (2012) (11)
- Open problems on graph eigenvalues studied with AutoGraphiX (2012) (11)
- The maximum return-on-investment plant location problem with market share (2005) (11)
- Edge-ratio network clustering by Variable Neighborhood Search (2013) (11)
- A linear algorithm for fixed bonds in hexagonal systems (1992) (11)
- The continuous p-median of a network (1989) (11)
- On pitfalls in computing the geodetic number of a graph (2005) (11)
- A note on reduction of quadratic and bilinear programs with equality constraints (2002) (11)
- Variable Neighbourhood Search for Colour Image Quantization (2006) (10)
- Variable Neighborhood Search for Extremal Graph. 7. Polyenes with Maximum HOMO-LUMO Gap (2001) (10)
- On uniform k-partition problems (2001) (10)
- Industrial Applications of the Variable Neighborhood Search Metaheuristic (2002) (10)
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (2008) (10)
- Comment on "Evolutionary method for finding communities in bipartite networks". (2011) (10)
- Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization (2014) (10)
- Efficient points on a network (1986) (10)
- A Separable Approximation Dynamic Programming Algorithm for Economic Dispatch with Transmission Losses (2000) (10)
- EM algorithm and varible Neighborhood Search for fitting Finite Mixture Model parameters (2009) (10)
- Improving Frequent Subgraph Mining in the Presence of Symmetry (2007) (9)
- Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis (2004) (9)
- A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm (2009) (9)
- First improvement may be better than best improvment: an empirical study (2005) (9)
- Static Symmetry Breaking in Circle Packing (2010) (9)
- Geometric-arithmetic index and minimum degree of connected graphs (2019) (9)
- Simple Polygons of Maximum Perimeter Contained in a Unit Disk (2007) (9)
- On a property of hypergraphs with no cycles of length greater than two (1974) (9)
- An algorithm for the minimum variance point of a network (1991) (9)
- A short discussion of the OR crisis (1989) (9)
- Ranking small regular polygons by area and by perimeter (2005) (9)
- New VNP for automatic programming (2017) (8)
- An Automated Procedure for Globally Optimal Design (1988) (8)
- The Normalized Revised Szeged Index (2011) (8)
- The Small Octagons of Maximal Width (2012) (8)
- Variable Neighborhood Search for Extremal Graphs. 27. Families of Extremal Graphs (2007) (8)
- Complexity of Product Positioning and Ball Intersection Problems (1991) (8)
- Weight constrained maximum split clustering (1989) (7)
- The smallest hard-to-color graph (1991) (7)
- New Algorithms for Product Positioning (1994) (7)
- An Exact Method for Fractional Goal Programming (2000) (7)
- A Signless Laplacian for the Distance Matrix of a Graph (2011) (7)
- Numerical Bounds for the Perfect Matching Vectors of a Polyhex (1994) (7)
- Simultaneous Static Unit Commitment and Economic Dispatch by Dynamic Programming (1996) (7)
- Using stable sets to bound the chromatic number (2003) (7)
- Probabilistic Satisfiability and Decomposition (1994) (6)
- On Lower Bounds for Numbered Complete Graphs (1997) (6)
- Adding cohesion constraints to models for modularity maximization in networks (2014) (6)
- Exact Sequential Algorithms for Additive Clustering (2000) (6)
- An O(tm log D) Algorithm for shortest paths (1980) (6)
- Using symbolic calculations to determine largest small polygons (2019) (6)
- A revised peeling algorithm for determining if a hexagonal system is Kekuléan (1991) (6)
- Paths with Minimum Range and Ratio of Arc Lengths (1996) (6)
- Compact Relaxations for Polynomial Programming Problems (2012) (6)
- SOME LOCALIZATION THEOREMS FOR A CONSTRAINED WEBER PROBLEM (1981) (6)
- On the difference of energies of a graph and its complement graph (2020) (5)
- Data Clustering using Large p -Median Models and Primal-Dual Variable Neighborhood Search (2007) (5)
- Variations on the Roy-Gallai theorem (2005) (5)
- Two Algorithms for Maximum Cliques in Dense Graphs (1992) (5)
- Variable Neighborhood Search for Multiprocessor Scheduling Problem with Communication Delays (2001) (5)
- Detection of spurious states of neural networks (1990) (5)
- Refutations, Results and Conjectures about the Balaban Index (2013) (5)
- The small hexagon and heptagon with maximum sum of distances between vertices (2008) (5)
- The geometric-arithmetic index and the chromatic number of connected graphs (2016) (5)
- Comparing the geometric-arithmetic index and the spectral radius of graphs (2016) (5)
- On the k-Medoids Model for Semi-supervised Clustering (2018) (5)
- Optimum departure times for commuters in congested networks (1991) (5)
- Exact solution of three nonconvex quadratic programming problems (2004) (5)
- A NOTE ON AIRLINE COMMUTING (1982) (5)
- Bounding Average Distance Using Order and Minimum Degree (2008) (5)
- Multivariate Lipschitz optimization: Survey and computational comparison (1994) (5)
- Implicit treatment of “zero or range” constraints in a model for minimum costfoundry alloys (1989) (5)
- Enumeration of fusenes to h = 20 (1998) (5)
- The p-center sum location problem (1994) (5)
- Finding a Kekule Structure in a Benzenoid System in Linear Time (1995) (5)
- Espaliers: A generalization of dendrograms (1992) (5)
- An Extension of Nested Satisfiability (1993) (5)
- SyGMA: Reducing Symmetry in Graph Mining (2007) (4)
- Perfect matchings and ears in elementary bipartite graphs (1996) (4)
- Assigning a Kekulé Structure to a Conjugated Molecule (1995) (4)
- Shortest Shortest Path Trees of a Network (1996) (4)
- A survey on exact methods for minimum sum-of-squares clustering (2008) (4)
- Column generation bounds for numerical microaggregation (2014) (4)
- On the Linear Maxmin and Related Programming Problems (1998) (4)
- Algorithms for l 1 -Embeddability and Related Problems (2003) (4)
- On the nullity number of graphs (2016) (4)
- A note on diameters of point sets (2009) (4)
- Bound constraints for Point Packing in a Square (2011) (4)
- Bicriterion Cluster Analysis as an Exploration Tool (1978) (4)
- Variable Neighborhood Search for Extremal Graphs. 24. Conjectures and Results About the Clique Number (2007) (4)
- On the Relations between Probabilistic Logic and p-CMS (1999) (4)
- Variable Neighborhood Search for Extremal Graphs. 15. On Bags and Bugs (2005) (4)
- Complete Enumeration of Equilibria for Two-Person Games in Strategic and Sequence Forms (1998) (4)
- Partial Pivoting in Vertex Enumeration (1992) (4)
- Solution of the multisource Weber problem by column generation and global optimization (1994) (4)
- A note on bimatrix game maximal Selten subsets (2014) (3)
- Variable Neighborhood Search for Extremal Graphs 28: AutoGraphiX After Fifteen Years (2013) (3)
- Polynomial algorithms for nested univariate clustering (1996) (3)
- Local Optima Topology for the 3-SAT Problem (1998) (3)
- Community detection with the weighted parsimony criterion (2012) (3)
- Shortest Paths in Signed Graphs (1984) (3)
- Variable Neighborhood Search for Edge-Ratio Network Clustering (2014) (3)
- Degeneracy of Harmonic Means Clustering (2011) (3)
- Using size for bounding expressions of graph invariants (2007) (3)
- Best Simplicial and Double-Simplicial Bounds for Concave Minimization (1996) (3)
- Reformulation of Two Bond Portfolio Optimization Models (1991) (3)
- On Clar graphs (1993) (3)
- Upper Bounds for the Clar Number of a Benzenoid Hydrocarbon. (1992) (3)
- Integral simplex using double decomposition for set partitioning problems (2019) (3)
- Connectivity, Transitivity and Chromaticity: The Pioneering Work of Bernard Roy in Graph Theory (2002) (3)
- Solving the Bicriterion Shortest Path Problem From Both Ends (1998) (3)
- A Comparison of Algorithms for the Maximum Clique Problem (1992) (3)
- Maximizing edge-ratio is NP-complete (2011) (2)
- Difficulties of Conditioning and Conditional Independence in Probabilistic Satisfiability (1999) (2)
- Distributed integral simplex for clustering (2018) (2)
- Edge Realizability of Connected Simple Graphs (2017) (2)
- A Linear Algorithm for the Hyper-wiener Number of Chemical Trees (1999) (2)
- Improving constrained pattern mining with first-fail-based heuristics (2011) (2)
- An Algorithm for Parametric Communities Detection in Networks (2011) (2)
- Discrete mathematical chemistry : DIMACS Workshop Discrete Mathematical Chemistry, March 23-24, 1998, Rutgers University (2000) (2)
- A Greedy Variable Neighborhood Search Heuristic for the MaxSumSum p -Dispersion Problem (2012) (2)
- Integral simplex using double decomposition (2017) (2)
- Reduced RLT constraints for polynomial programming (2010) (2)
- Computational Methods in Clustering from a Mathematical Programming Viewpoint (1996) (2)
- The price of equity in the Hazmat Transportation Problem (2011) (2)
- Isoperimetric Polygons of Maximal Width (2006) (2)
- Degrees and independent sets of hypergraphs (1976) (2)
- A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs (1994) (1)
- On the Relationship between Probabilistic Logic and -CMS (1999) (1)
- Maximum Split Single Cluster Clustering (1993) (1)
- Remarks on solutions to a nonconvex quadratic programming test problem (2008) (1)
- Extension of Turán's Theorem to the 2-Stability Number (1998) (1)
- Corrigendum to “On the difference of energies of a graph and its complement graph” [Linear Algebra Appl. 595 (2020) 1–12] (2021) (1)
- Subdegrees and Chromatic Numbers of Hypergraphs (1977) (1)
- Continuous Optimization by Variable Neighborhood Search - A Chapter for Encyclopedia of Operations Research and Management Science (EORMS) (2013) (1)
- A Hybrid Space-Economic Model Generating World Demo-Economic Projections (2011) (1)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (2014) (1)
- Probabilistic satis ® ability with imprecise probabilities (2000) (1)
- Clustering - A Chapter for Handbook of Discrete and Combinatorial Optimization (2008) (1)
- Modularity clustering on trees (2012) (1)
- Chemical Tree Enumeration Algorithms ⋆ (1999) (1)
- Correctness of Anytime Deduction for Probabilistic Logic (1997) (1)
- Modularity maximization clustering with cohesion conditions (2015) (1)
- Covering a square with six circles by deterministic global optimization (2019) (1)
- On Proper Refinement of Bimatrix Games Extreme Nash Equilibria (2010) (1)
- Perfect and Proper Refinements of All Extreme Nash Equilibria for Bimatrix Games (2007) (1)
- Mixed Integer Programming and Extremal Chemical Graphs (2018) (1)
- Variable Neighborhood Search Heuristics for the MaxMinSum (p-Dispersion-Sum) Problem (2012) (1)
- Transfer Pricing in a Global Supply Chain (2008) (1)
- The Maximum Number of Kekule Structures of Cata-condensed Polyhexes (1993) (1)
- Algorithms for network modularity maximization (2010) (1)
- Convergence of Variable neighrbourhood search (2005) (1)
- Automated generation of conjectures on forbidden subgraph characterization (2007) (1)
- Algorithms for ℓ1-Embeddability and Related Problems (2007) (1)
- A Variable Neighborhood Search Heuristic for Normalized Cut Clustering (2010) (1)
- Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number (2010) (1)
- A Polynomial Algorithm for a Class of 0-1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (2014) (1)
- Weber's Problem with Forbidden Regions for Location and Transportation (2000) (1)
- Continuous Optimization by Variable Neighborhood Search (2015) (1)
- MIC ’ 2001-4 th Metaheuristics International Conference 595 Parallel Variable Neighbourhood Search for the p-Median Teodor (2002) (0)
- A ( N 2) Algorithm for the Maximum Sum-of-Splits Clustering Problem (1989) (0)
- The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models (2011) (0)
- Spectral properties of threshold graphs (2020) (0)
- A Strong Heuristic Algorithm for Maximum Likelihood Estimation of the 3-Parameter Weibull Distribution (1992) (0)
- FROM THE MEDIAN TO THE GEWERALIZED CENTER ( * ) (2017) (0)
- Edge-ratio network clustering by Variable Neighborhood Search (2014) (0)
- WEBER'S PROBLEM WITH ATTRACTION AND REPULSION" Pey-Chun Chen (1992) (0)
- Sequential clustering with radius and split criteria (2012) (0)
- Variable Neighborhood Search Heuristics for the MaxMinSum ( p-Dispersion-Sum ) Problem Behnaz Saboonchi (2012) (0)
- An interval arithmetic algorithm for multivariate constrained global optimization using cord-slope forms of Taylor's expansion (1998) (0)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (1995) (0)
- A Note on Assigning a Kekule Structure to a Chemical Graph (1994) (0)
- Franchise Location Models and Cannibalization Effects: A Variable Neighborhood Search Approach (2012) (0)
- Extensions to Column Generation for Globally Optimal Clusterwise Regression (2011) (0)
- A Note on Restarted and Modified Simplex Search for Unconstrained Optimization (2008) (0)
- HENG An algorithm for the minimum variance point of a network Revue française d ’ automatique (2011) (0)
- Using Heuristics to Speed Up Frequent Pattern Mining (2008) (0)
- Dynamic Point Selection for the L 1 Norm Hyperplane Separation Problem (2005) (0)
- IMPROVEMENTSANDCOMPARISONOF HEURISTICS FOR SOLVING THEUNCAPACITATEDMULTISOURCEWEBER PROBLEM (2008) (0)
- The Jackknife Revisited: Feature Selection in Linear Programming Approaches to Credit Scoring (2006) (0)
- Chargement optimal des groupes turbo-alternateurs (2004) (0)
- Mutations of Test Problems for Geometric Programming - A Cautionary Tale (2009) (0)
- Fitting travel distances by Ip norms (2000) (0)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (2013) (0)
- Bounds on differences between some graph theoretic invariants (2015) (0)
- A reliable affine relaxation method for global optimization (2014) (0)
- Mining graphs to discover new theorems in mathematics (2009) (0)
- Variable Neighborhood Search for beginners (2015) (0)
- Variable Neighborhood Search for Extremal Graphs . 15 . On Bags and Bugs 1 (2005) (0)
- Selected papers on Third advanced research institute of discrete applied mathematics (1991) (0)
- Global exact optimization for covering a rectangle with 6 circles (2021) (0)
- Distributed integral column generation (2018) (0)
- some graph theoretic invariants (2015) (0)
- Arbitrary-norm Separation by Variable Neighborhood Search Gilles Caporossi (2005) (0)
- Geometric-arithmetic index and degrees of connected graphs (2016) (0)
- Synthesis of LC 3-terminal networks by mixed-integer programming (1974) (0)
- A relation between proximity and the third largest distance eigenvalue of a graph (2021) (0)
- Belief, Evidence, and Conditioning (2006) (0)
- Chapter 8 VARIABLE NEIGHBORHOOD SEARCH (2007) (0)
- Reformulation of a locally optimal heuristic for modularity maximization (2012) (0)
- Exact Solution of -norm and -norm Plane Separation (2004) (0)
- Selected papers on First international colloquium on pseudo-boolean optimization and related topics (1990) (0)
- Heuristic procedures to solve the discrete ordered median problem (2005) (0)
- An improved column generation algorithm for minimum sum-of-squares clustering (2010) (0)
- Global optimization workshop 2012 (2014) (0)
- Report of the Session on Structural Aspects of Discrete Problems (1979) (0)
- Bruno Simeone's Work in Clustering (2011) (0)
- Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization (2014) (0)
- Integer programming, fullerenes and nanotubes (1994) (0)
- Network Flows and Nonlinear 0–1 Programming (1984) (0)
- Finding conjectures in graph theory with AutoGraphiX (2016) (0)
- Analytical Solution for Probabilistic Logic with Conditional Probabilities (2000) (0)
- Economic Dispatch of Turbo-Alternator Units with Spinning Reserve (2004) (0)
- The price of equity in the Hazmat (2011) (0)
- Three ways to automate ) nding conjectures (2003) (0)
- Reformulation of a model for hierarchical divisive graph modularity maximization (2012) (0)
- Distributed Integral Column Generation for Set Partitioning Problems (2022) (0)
- Community detection with the weighted parsimony criterion (2015) (0)
- Symmetry breaking constraints for the circle packing in a square problem (2011) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Pierre Hansen?
Pierre Hansen is affiliated with the following schools: