Hansen, P. (Pierre)
Hansen, Pierre.
Hansen, Pierre 1940-....
Pierre Hansen mathématicien canadien
Hansen, P., fl. 1981
VIAF ID: 44631019 ( Personal )
Permalink: http://viaf.org/viaf/44631019
Preferred Forms
- 200 _ | ‡a Hansen ‡b Pierre ‡f 1940-....
- 100 1 _ ‡a Hansen, P. ‡q (Pierre)
- 100 1 0 ‡a Hansen, P. ‡q (Pierre)
-
-
-
-
-
- 100 1 _ ‡a Hansen, Pierre
-
-
- 100 1 _ ‡a Hansen, Pierre
-
-
- 100 1 _ ‡a Hansen, Pierre ‡d 1940-
-
- 100 0 _ ‡a Pierre Hansen ‡c mathématicien canadien
4xx's: Alternate Name Forms (13)
5xx's: Related Names (1)
Works
Title | Sources |
---|---|
Algorithms for l[subscript]1-embeddability and related problems | |
An Analytical approach to global optimization | |
Automated results and conjectures on average distance in graphs | |
Average distance and maximum induced forest | |
Best second order bounds for two-terminal network reliability with dependent edge failures | |
Best simplicial and double-simplicial bounds for concave minimization | |
Boole's conditions of possible experience and reasoning under uncertainty | |
Bounds and conjectures for the signless Laplacian index of graphs | |
Competitive location with random utilities : problem formulation and algorithms | |
Computational methods in clustering from a mathematical programming viewpoint | |
Constrained nonlinear 0-1 programming | |
Discrete mathematical chemistry : DIMACS workshop Discrete mathematical chemistry, March 23-24, 1998, Rutgers University | |
Edge ratio and community structure in networks | |
Edge realizability of connected simple graphs | |
Efficient algorithms for divisive hierarchical clustering with the diameter criterion | |
Enumeration of Polyhex Hydrocarbons to h=21. | |
Espaliers : a generalization of dendrograms | |
Essays and surveys in global optimization | |
Essays and surveys on multiple criteria decision making : proceedings of the fifth International Conference on Multiple Criteria Decision Making. Mons, Belgium, August 9-13, 1982 | |
An exact method for fractional goal programming | |
Extremal problems for convex polygons : an update | |
Facility location under zone pricing | |
Finding relations in polynomial time | |
Global optimization of univariate Lipschitz functions | |
Graph colouring and applications | |
The height and length of colour switching | |
Heuristic solution of the Multisource Weber problem as a p-median problem | |
An impossibility result in axiomatic location theory | |
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem | |
Improving interval analysis bounds by translations | |
A Laplacian for the distance matrix of a graph | |
A learning optimization algorithm in graph theory : versatile search for extremal graphs using a learning algorithm | |
A Linear algorithm for perfect matching in hexagonal systems | |
Location and sizing of off-shore platforms for oil exploration | |
Mean-preserving changes in risk with tail-dominance | |
Merging the local and global approaches to probabilistic satisfiability | |
The minimum spectral radius of graphs with a given clique number | |
Minimum sum of squares clustering in a low dimensional space | |
Mixed graph colorings | |
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem | |
Mutations of test problems for geometric programming : a cautionary tale | |
Nesticity | |
New algorithms for product positioning | |
New Branch and bound rules for linear bilevel programming | |
A new column generation algorithm for logical analysis of data | |
On lower bounds for numbered complete graphs | |
On the number of iterations of Piyavskii's global optimization algorithm | |
On the relationship between probabilistic logic and [pi]-CMS | |
Partitioning data sets : DIMACS workshop, April 19-21, 1993 | |
Paths with minimum range and ratio of arc lengths | |
Polynomial algorithms for nested univariate clustering | |
Le Problème de la satisfaisabilité probabiliste et ses extensions | |
Proximity, remoteness and girth in graphs | |
Ranking small regular polygons by area and by perimeter | |
Recherche à voisinage variable | |
Reduction of indefinite quadratic programs to bilinear programs | |
Regards sur la théorie des graphes : actes du Colloque de Cerisy, 12-18 juin 1980 = proceedings of the Cerisy Colloquium | |
Stable sets and chromatic number | |
A strong heuristic algorithm for maximum likelihood estimation of the 3-parameter Weibull distribution | |
Studies on graphs and discrete programming, 1981 (a.e.) | |
A survey of Nordhaus-Gaddum type relations | |
Systems of cities and facility location | |
Variable neighborhood search for extremal graphs : 9 : bounding the irregularity of a graph | |
Variable neighborhood search for finding parameter values in finite mixture model | |
A variable neighborhood search heuristic for normalized cut clustering | |
Variable neighborhood search : principles and applications | |
Weight constrained maximum split clustering |