Similar Search Results

The simple plant location problem

Hansen, P. - In: Omega 4 (1976) 3, pp. 347-349

Persistent link: https://www.econbiz.de/10005445606

Weight constrained maximum split clustering

Hansen, P.; Jaumard, B.; Musitu, K. - In: Journal of Classification 7 (1990) 2, pp. 217-240

Persistent link: https://www.econbiz.de/10005376149

The profit-maximizing Weber problem

HANSEN, P.; PEETERS, D.; THISSE, J.-F. - Center for Operations Research and Econometrics (CORE), …

Persistent link: https://www.econbiz.de/10010926251

Facility location under zone pricing

HANSEN, P.; PEETERS, D.; THISSE, J.-F. - Center for Operations Research and Econometrics (CORE), …

Persistent link: https://www.econbiz.de/10010927074

RÉSUMÉS - ABSTRACTS - ZUSAMMENFASSUNGEN

HANSEN, P.; PEETERS, D.; THISSE, J.-F. - In: Annals of Public and Cooperative Economics 51 (1980) 1-2, pp. 177-190

Persistent link: https://www.econbiz.de/10011037631

Maximum sum-of-splits clustering

Hansen, P.; Jaumard, B.; Frank, O. - In: Journal of Classification 6 (1989) 1, pp. 177-193

Persistent link: https://www.econbiz.de/10005602886

Minimum sum of diameters clustering

Hansen, P.; Jaumard, B. - In: Journal of Classification 4 (1987) 2, pp. 215-226

Persistent link: https://www.econbiz.de/10005602888

Efficient algorithms for divisive hierarchical clustering with the diameter criterion

Guénoche, A.; Hansen, P.; Jaumard, B. - In: Journal of Classification 8 (1991) 1, pp. 5-30

Persistent link: https://www.econbiz.de/10005602949

A note on duality gap in the simple plant location problem

Mladenovic, N.; Brimberg, J.; Hansen, P. - In: European Journal of Operational Research 174 (2006) 1, pp. 11-22

Persistent link: https://www.econbiz.de/10005337607

Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph

Aouchiche, M.; Bell, F.K.; Cvetkovic, D.; Hansen, P.; … - In: European Journal of Operational Research 191 (2008) 3, pp. 661-676

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX, designed for finding extremal graphs with respect to given...

Persistent link: https://www.econbiz.de/10005287412