What is he best known for?
The fields of study he is best known for:
- Algorithm
- Mathematical optimization
- Linear programming
Darwin Klingman focuses on Mathematical optimization, Algorithm, Linear programming, Simplex algorithm and Flow network.
His Integer programming and Scheduling study, which is part of a larger body of work in Mathematical optimization, is frequently linked to Inverse and Compactification, bridging the gap between disciplines.
His Algorithm research is multidisciplinary, incorporating elements of Shortest Path Faster Algorithm, Constrained Shortest Path First and Longest path problem, Canadian traveller problem.
His Linear programming research is multidisciplinary, relying on both Scheduling and Theoretical computer science.
His Simplex algorithm study combines topics from a wide range of disciplines, such as Simplex, Extreme point and Degeneracy.
When carried out as part of a general Flow network research project, his work on Minimum-cost flow problem is frequently linked to work in Usability, therefore connecting diverse disciplines of study.
His most cited work include:
- NETGEN Revisited: A Program for Generating Large Scale (Un)Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems. (390 citations)
- A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees. (205 citations)
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems (155 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Mathematical optimization, Linear programming, Algorithm, Flow network and Simplex algorithm.
His work carried out in the field of Mathematical optimization brings together such families of science as Degeneracy and Dual.
He performs integrative Linear programming and Computer programming research in his work.
His research investigates the connection with Algorithm and areas like Simplex which intersect with concerns in Representation.
The concepts of his Flow network study are interwoven with issues in Maximum flow problem, Management science and Transshipment, Operations research.
His research investigates the connection between Theoretical computer science and topics such as Search engine indexing that intersect with issues in Expediting.
He most often published in these fields:
- Mathematical optimization (50.00%)
- Linear programming (41.80%)
- Algorithm (30.33%)
What were the highlights of his more recent work (between 1983-1992)?
- Mathematical optimization (50.00%)
- Algorithm (30.33%)
- Shortest path problem (9.84%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Mathematical optimization, Algorithm, Shortest path problem, Linear programming and K shortest path routing.
His studies deal with areas such as Deadline-monotonic scheduling, Component and Fair-share scheduling as well as Mathematical optimization.
His Algorithm study integrates concerns from other disciplines, such as Simplex and Graph.
Darwin Klingman conducts interdisciplinary study in the fields of Linear programming and Relaxation through his works.
His biological study spans a wide range of topics, including Longest path problem and Yen's algorithm.
His studies in Simplex algorithm integrate themes in fields like Maximum flow problem and Flow network.
Between 1983 and 1992, his most popular works were:
- A New Polynomially Bounded Shortest Path Algorithm (101 citations)
- Computational study of an improved shortest path algorithm (64 citations)
- New Polynomial Shortest Path Algorithms and Their Computational Attributes (43 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Mathematical optimization
- Algebra
Darwin Klingman mainly investigates Shortest path problem, Algorithm, K shortest path routing, Constrained Shortest Path First and Yen's algorithm.
The Linear programming and Simplex algorithm research Darwin Klingman does as part of his general Algorithm study is frequently linked to other disciplines of science, such as Graphics and Bounded function, therefore creating a link between diverse domains of science.
His work deals with themes such as Pathfinding, Longest path problem and Mathematical optimization, which intersect with K shortest path routing.
The Euclidean shortest path study combines topics in areas such as Suurballe's algorithm, Widest path problem, Average path length and Distance.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
