Related Research Articles
In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.
Eli Yablonovitch is an American physicist and engineer who, along with Sajeev John, founded the field of photonic crystals in 1987. He and his team were the first to create a 3-dimensional structure that exhibited a full photonic bandgap, which has been named Yablonovite. In addition to pioneering photonic crystals, he was the first to recognize that a strained quantum-well laser has a significantly reduced threshold current compared to its unstrained counterpart. This is now employed in the majority of semiconductor lasers fabricated throughout the world. His seminal paper reporting inhibited spontaneous emission in photonic crystals is among the most highly cited papers in physics and engineering.
Julia Hall Bowman Robinson was an American mathematician noted for her contributions to the fields of computability theory and computational complexity theory—most notably in decision problems. Her work on Hilbert's tenth problem played a crucial role in its ultimate resolution. Robinson was a 1983 MacArthur Fellow.
Evelyn Martin Lansdowne Beale FRS was an applied mathematician and statistician who was one of the pioneers of mathematical programming.
Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.
The Concorde TSP Solver is a program for solving the travelling salesman problem. It was written by David Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook, in ANSI C, and is freely available for academic use.
Emmanuel Jean Candès is a French statistician most well known for his contributions to the field of Compressed sensing and Statistical hypothesis testing. He is a professor of statistics and electrical engineering at Stanford University, where he is also the Barnum-Simons Chair in Mathematics and Statistics. Candès is a 2017 MacArthur Fellow.
BARON is a computational system for solving non-convex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved by the solver. Linear programming (LP), nonlinear programming (NLP), mixed integer programming (MIP), and mixed integer nonlinear programming (MINLP) are supported. In a comparison of different solvers, BARON solved the most benchmark problems and required the least amount of time per problem.
William John Cook is an American operations researcher and mathematician, and Professor of Combinatorics and Optimization at the University of Waterloo.
Michael Alan Saunders is a New Zealand American numerical analyst and computer scientist. He is a research professor of Management Science and Engineering at Stanford University. Saunders is known for his contributions to numerical linear algebra and numerical optimization and has developed many widely used software packages, such as MINOS, NPSOL, and SNOPT.
Laurence Alexander Wolsey is a Belgian-English mathematician working in the field of integer programming. His mother Anna Wolsey-Mautner was the daughter of the Viennese Industrialist Konrad David Mautner. He is a former president and research director of the Center for Operations Research and Econometrics (CORE) at Université catholique de Louvain in Belgium. He is professor emeritus of applied mathematics at the engineering school of the same university.
Stephen P. Boyd is an American professor and control theorist. He is the Samsung Professor of Engineering, Professor in Electrical Engineering, and professor by courtesy in Computer Science and Management Science & Engineering at Stanford University. He is also affiliated with Stanford's Institute for Computational and Mathematical Engineering (ICME).
MINOS is a Fortran software package for solving linear and nonlinear mathematical optimization problems. MINOS may be used for linear programming, quadratic programming, and more general objective functions and constraints, and for finding a feasible point for a set of linear or nonlinear equalities and inequalities.
JuMP is an algebraic modeling language and a collection of supporting packages for mathematical optimization embedded in the Julia programming language. JuMP is used by companies, government agencies, academic institutions, software projects, and individuals to formulate and submit optimization problems to third‑party solvers. JuMP has been specifically applied to problems in the field of operations research.
András Sebő is a Hungarian-French mathematician working in the areas of combinatorial optimization and discrete mathematics. Sebő is a French National Centre for Scientific Research (CNRS) Director of Research and the head of the Combinatorial Optimization. group in Laboratory G-SCOP, affiliated with the University of Grenoble and the CNRS.
Edith Cohen is an Israeli and American computer scientist specializing in data mining and algorithms for big data. She is also known for her research on peer-to-peer networks. She works for Google in Mountain View, California, and as a visiting professor at Tel Aviv University in Israel.
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation is a book on the travelling salesman problem, by William J. Cook, published in 2011 by the Princeton University Press, with a paperback reprint in 2014. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.
Robert A. (Bob) Bosch is an author, recreational mathematician and the James F. Clark Professor of Mathematics at Oberlin College. He is known for domino art and for combining graph theory and mathematical optimization to design connect-the-dots eye candy: labyrinths, knight's tours, string art and TSP Art.
Vera Traub is a German applied mathematician and theoretical computer scientist known for her research on approximation algorithms for combinatorial optimization problems including the travelling salesperson problem and the Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn.
Defeng Sun is a Chinese applied mathematician and operations researcher. He holds the position of Chair Professor of Applied Optimization and Operations Research, and has been serving as the Head of Department of Applied Mathematics in The Hong Kong Polytechnic University (PolyU) since 2019. Sun had been the President of The Hong Kong Mathematical Society in 2020-2024.
References
- 1 2 3 4 "David Applegate", Research at Google, retrieved 2017-08-03
- ↑ David Applegate at the Mathematics Genealogy Project
- ↑ Past Winners of the Beale — Orchard-Hays Prize, Mathematical Optimization Society , retrieved 2017-08-03.
- 1 2 "David L. Applegate", Recognizing Excellence: Award Recipients, Institute for Operations Research and the Management Sciences , retrieved 2017-08-03
- 1 2 The IEEE Communications Society William R. Bennett Prize, retrieved 2017-08-03
- 1 2 3 Applegate, David; Lebrun, Marc; Sloane, N. J. A. (2010), "Carryless Arithmetic Mod 10", George Pólya Awards, Mathematical Association of America, arXiv: 1008.4633 , retrieved 2017-08-03[ permanent dead link ]
- ↑ Gardner, Martin (2001), The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems : Number Theory, Algebra, Geometry, Probability, Topology, Game Theory, Infinity, and Other Topics of Recreational Mathematics, W. W. Norton & Company, p. 491, ISBN 9780393020236
- ↑ Peterson, Ivars (2002), Mathematical Treks: From Surreal Numbers to Magic Circles, MAA Spectrum, Mathematical Association of America, p. 71, ISBN 9780883855379
- ↑ Lenstra, Jan Karel; Shmoys, David (2009), "The traveling salesman problem: a computational study", SIAM Review, 51 (4): 799–801, MR 2573947
