Christopher C. Skiscim
From MaRDI portal
Person:170641
Available identifiers
zbMath Open skiscim.christopher-cMaRDI QIDQ170641
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| The complexity of minimum ratio spanning tree problems | 2005-11-16 | Paper |
| Minimum spanning trees with sums of ratios. | 2004-02-18 | Paper |
| Solving k-shortest and constrained shortest path problems efficiently | 1989-01-01 | Paper |
| Computingk-shortest path lengths in euclidean networks | 1987-01-01 | Paper |
| Using simulated annealing to solve routing and location problems | 1986-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Christopher C. Skiscim
