Joseph E. KuhnJoseph E. Kuhn (June 14, 1864 – November 12, 1935) was a career officer in the United States Army. He attained the rank of major general, and was most notable for his command of the 79th Division during World War I, and his post-war commands of IX Corps, Schofield Barracks, and Vancouver Barracks. A native of Leavenworth, Kansas, Kuhn graduated at the top of his United States Military Academy (USMA) class of 1885; assigned to the Engineers, he carried out rivers and harbors construction and maintenance assignments in Detroit and San Francisco.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
Problem solvingProblem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from simple personal tasks (e.g. how to turn on an appliance) to complex issues in business and technical fields. The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles.
Semidefinite programmingSemidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems.
Bro CodeIn popular culture, the Bro Code is a friendship etiquette to be followed among men or, more specifically, among members of the bro subculture. The term was invented and popularized by Barney Stinson, a character from the television show How I Met Your Mother. Katherine Connor Martin, head of content creation at Oxford Dictionaries, recognized Stinson as "the quintessence of a certain iteration of the contemporary bro". The notion of an unwritten set of rules that govern the relationship between straight male friends is present in modern American popular culture at least since 1991.
Cutting stock problemIn operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted. It is an optimization problem in mathematics that arises from applications in industry. In terms of computational complexity, the problem is an NP-hard problem reducible to the knapsack problem. The problem can be formulated as an integer linear programming problem.
Decision problemIn computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers x and y, does x evenly divide y?". The answer is either 'yes' or 'no' depending upon the values of x and y. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem.
Travelling salesman problemThe 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. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
European Prize in CombinatoricsThe European Prize in Combinatorics is a prize for research in combinatorics, a mathematical discipline, which is awarded biennially at Eurocomb, the European conference on combinatorics, graph theory, and applications. The prize was first awarded at Eurocomb 2003 in Prague. Recipients must not be older than 35. The most recent prize was awarded at Eurocomb 2021 in Barcelona (Online). 2003 Daniela Kühn, Deryk Osthus, Alain Plagne 2005 Dmitry Feichtner-Kozlov 2007 Gilles Schaeffer 2009 Peter Keevash, Balázs
Jacob SchiffJacob Henry Schiff (born Jakob Heinrich Schiff; January 10, 1847 – September 25, 1920) was a German Confederation-born American banker, businessman, and philanthropist. Among many other things, he helped finance the expansion of American railroads, and the Japanese military efforts against Tsarist Russia in the Russo-Japanese War. Born in Frankfurt, Germany, Schiff migrated to the United States after the American Civil War and joined the firm Kuhn, Loeb & Co.
GilyonimGilyonim, or avon gilyon, are terms used by the Mishnah and Talmud to refer to certain heretical works. The Jewish Christians of Palestine had a Gospel of their own, the so-called Hebrew Gospel, from which still later Church Fathers quote. Matthew was, likewise, often thought to have been originally written in Hebrew (that is, Aramaic); if so, many copies must, therefore, have been in circulation, and doubts must naturally have arisen concerning the manner in which they were to be disposed of, since they contained mention of the divine name.
Master theorem (analysis of algorithms)In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis (using Big O notation) for recurrence relations of types that occur in the analysis of many divide and conquer algorithms. The approach was first presented by Jon Bentley, Dorothea Blostein (née Haken), and James B. Saxe in 1980, where it was described as a "unifying method" for solving such recurrences. The name "master theorem" was popularized by the widely-used algorithms textbook Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein.
