Kenneth E Rosing
Biographic Data
| ID | 1473916 |
|---|---|
| NAME | Kenneth E Rosing |
| GIVEN NAMES | Kenneth E |
| FAMILY NAME | Rosing |
| SIGNATURE | ROSING K E |
| AFFILIATIONS | Erasmus University Rotterdam |
| VERIFIED | No |
| TOTAL WORKS | 8 |
| TOTAL CITATIONS | 6 |
| AUTHOR COUNT | 8 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1971 |
| LATEST PUBLICATION YEAR | 1992 |
| H-INDEX | 1 |
Algorithmic and Technical Improvements: Optimal Solutions to the (Generalized) Multi‐weber Problem
Algorithmic and technical improvements: Optimal solutions to the (Generalized) Multi-Weber Problem
Optimal Clustering
Cluster analysis can be performed with several models. One method is to seek those clusters for which the total flow between all within-cluster members is a maximum. This model has, until now, been viewed as mathematically difficult because of the presence of products of integer variables in the objective function. In another optimization model of cluster analysis, the p-median, a central member is found for each cluster, so that relationships of…
The Future of Oil
The Future of Oil
The future of oil: Hypothesis and conclusions
The Robustness of Two Common Heuristics for the p-Median Problem
Optimal p-median solutions were computed for six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rap…
Character of a Conurbation: A Computer Atlas of Birmingham and the Black Country
Character of a Conurbation: A Computer Atlas of Birmingham and the Black Country
Algorithmic and technical improvements: Optimal solutions to the (Generalized) Multi-Weber Problem
Optimal Clustering
Cluster analysis can be performed with several models. One method is to seek those clusters for which the total flow between all within-cluster members is a maximum. This model has, until now, been viewed as mathematically difficult because of the presence of products of integer variables in the objective function. In another optimization model of cluster analysis, the p-median, a central member is found for each cluster, so that relationships of…
The Robustness of Two Common Heuristics for the p-Median Problem
Optimal p-median solutions were computed for six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rap…
Character of a Conurbation: A Computer Atlas of Birmingham and the Black Country
The Robustness of Two Common Heuristics for the p-Median Problem
Optimal p-median solutions were computed for six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rap…
The future of oil: Hypothesis and conclusions
The Future of Oil
The Future of Oil
Optimal Clustering
Cluster analysis can be performed with several models. One method is to seek those clusters for which the total flow between all within-cluster members is a maximum. This model has, until now, been viewed as mathematically difficult because of the presence of products of integer variables in the objective function. In another optimization model of cluster analysis, the p-median, a central member is found for each cluster, so that relationships of…
Algorithmic and Technical Improvements: Optimal Solutions to the (Generalized) Multi‐weber Problem
Algorithmic and technical improvements: Optimal solutions to the (Generalized) Multi-Weber Problem
Mathematics (5 works) · Computer Science (4 works) · Mathematical optimization (4 works) · Algorithm (3 works) · Global Energy and Sustainability Research (3 works) · Economics (2 works) · Engineering (2 works) · Environmental Science (2 works) · Facility Location and Emergency Management (2 works) · Geography (2 works)