Set cover problemThe set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a set of elements {1, 2, ..., n} (called the universe) and a collection S of m sets whose union equals the universe, the set cover problem is to identify the smallest sub-collection of S whose union equals the universe. For example, consider the universe U = {1, 2, 3, 4, 5} and the collection of sets S = { {1, 2, 3}, {2, 4}, {3, 4}, {4, 5} }.
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.
Greedy algorithmA greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city.
Admissible heuristicIn computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path. It is related to the concept of consistent heuristics. While all consistent heuristics are admissible, not all admissible heuristics are consistent. An admissible heuristic is used to estimate the cost of reaching the goal state in an informed search algorithm.
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.
Isobel Miller KuhnIsobel Selina Miller Kuhn, born Isobel Selina Miller, aka, "Belle" (December 17, 1901 – March 20, 1957), known as Isobel Kuhn, was a Canadian Christian missionary to the Lisu people of Yunnan Province, China, and northern Thailand. She served with the China Inland Mission, along with her husband, John, as a Bible translator, church planter, Bible teacher, evangelist and authored nine books about her experiences. Isobel Selina Miller was born in Toronto, Ontario, Canada, and moved with her family to Vancouver, British Columbia, when she was eleven years old.
Nonlinear programmingIn mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.
Jeff KuhnJeffrey Richard Kuhn, also known as Jeff Kuhn, is an American physicist and astronomer who is a professor of astronomy at the University of Hawaii. He is known for his contributions to astrophysics and the search for extraterrestrial life, particularly in the areas of telescope and detection system development, the study of the Sun and its corona, and the search for planets around other stars.
Gajski–Kuhn chartThe Gajski–Kuhn chart (or Y diagram) depicts the different perspectives in VLSI hardware design. Mostly, it is used for the development of integrated circuits. Daniel Gajski and Robert Kuhn developed it in 1983. In 1985, Robert Walker and Donald Thomas refined it. According to this model, the development of hardware is perceived within three domains that are depicted as three axis and produce a Y. Along these axis, the abstraction levels that describe the degree of abstraction.
Daniel HumairDaniel Humair (born 23 May 1938 in Geneva, Switzerland) is a Swiss drummer, composer, and painter. He is widely renowned and became a Chevalier of the Ordre des Arts et des Lettres in 1986 and Officier in 1992. He has played with many jazz performers notably Phil Woods, Jean-Luc Ponty, Chet Baker, Michel Portal, Martial Solal, Dexter Gordon, Gerry Mulligan, Rahsaan Roland Kirk and Eric Dolphy. Humair is also a talented painter. He describes his own work as "figurative abstract" and has created a coherent œuvre proving his passion and knowledge of artistic painting.
Hamiltonian path problemIn the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
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.
