Combinatorial optimizationCombinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.
Battery electric multiple unitA battery electric multiple unit (BEMU), battery electric railcar or accumulator railcar is an electrically driven multiple unit or railcar whose energy is derived from rechargeable batteries driving the traction motors. Prime advantages of these vehicles include the fact that they do not use fossil fuels such as coal or diesel fuel, emit no exhaust gases and do not require the railway to have expensive infrastructure like electric ground rails or overhead catenary.
Nurse scheduling problemThe nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields. The nurse scheduling problem has been studied since before 1969, and is known to have NP-hard complexity.
Wicked problemIn planning and policy, a wicked problem is a problem that is difficult or impossible to solve because of incomplete, contradictory, and changing requirements that are often difficult to recognize. It refers to an idea or problem that cannot be fixed, where there is no single solution to the problem; and "wicked" denotes resistance to resolution, rather than evil. Another definition is "a problem whose social complexity means that it has no determinable stopping point".
Constructivism (philosophy of mathematics)In the philosophy of mathematics, constructivism asserts that it is necessary to find (or "construct") a specific example of a mathematical object in order to prove that an example exists. Contrastingly, in classical mathematics, one can prove the existence of a mathematical object without "finding" that object explicitly, by assuming its non-existence and then deriving a contradiction from that assumption. Such a proof by contradiction might be called non-constructive, and a constructivist might reject it.
Autonomous administrative divisionAn autonomous administrative division (also referred to as an autonomous area, entity, unit, region, subdivision, or territory) is a subnational administrative division or internal territory of a sovereign state that has a degree of autonomy—self-governance—under the national government. Autonomous areas are distinct from the constituent units of a federation (e.g. a state, or province) in that they possess unique powers for their given circumstances. Typically, it is either geographically distinct from the rest of the state or populated by a national minority.
Range extenderA range extender is a fuel-based auxiliary power unit (APU) that extends the range of a battery electric vehicle by driving an electric generator that charges the vehicle's battery. This arrangement is known as a series hybrid drivetrain. The most commonly used range extenders are internal combustion engines, but fuel-cells or other engine types can be used. Range extender vehicles are also referred to as extended-range electric vehicles (EREV), range-extended electric vehicles (REEV), and range-extended battery-electric vehicle (BEVx) by the California Air Resources Board (CARB).
