When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Transshipment problem - Wikipedia

    en.wikipedia.org/wiki/Transshipment_problem

    Transshipment problems form a subgroup of transportation problems, where transshipment is allowed. In transshipment, transportation may or must go through intermediate nodes, possibly changing modes of transport. The Transshipment problem has its origins in medieval times [dubious – discuss] when trading started to become a mass phenomenon ...

  3. Transportation theory (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Transportation_theory...

    In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. [1] In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically.

  4. Assignment problem - Wikipedia

    en.wikipedia.org/wiki/Assignment_problem

    This is an unbalanced assignment problem. One way to solve it is to invent a fourth dummy task, perhaps called "sitting still doing nothing", with a cost of 0 for the taxi assigned to it. This reduces the problem to a balanced assignment problem, which can then be solved in the usual way and still give the best solution to the problem.

  5. Transport puzzle - Wikipedia

    en.wikipedia.org/wiki/Transport_puzzle

    Transport puzzles are logistical puzzles, which often represent real-life transportation problems. The classic transport puzzle is the river crossing puzzle in which three objects are transported across a river one at time while avoiding leaving certain pairs of objects together. The term should not be confused with the usage of transport ...

  6. Signed graph - Wikipedia

    en.wikipedia.org/wiki/Signed_graph

    Finding the frustration index is an NP-hard problem. One can see the NP-hard complexity by observing that the frustration index of an all-negative signed graph is the same as the maximum cut problem in graph theory, which is NP-hard. The frustration index is important in a model of spin glasses, the mixed Ising model. In this model, the signed ...

  7. Orthogonal Procrustes problem - Wikipedia

    en.wikipedia.org/wiki/Orthogonal_Procrustes_problem

    The orthogonal Procrustes problem [1] is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A {\displaystyle A} and B {\displaystyle B} and asked to find an orthogonal matrix Ω {\displaystyle \Omega } which most closely maps A {\displaystyle A} to B {\displaystyle B} .

  8. Balun - Wikipedia

    en.wikipedia.org/wiki/Balun

    A balun / ˈ b æ l ʌ n / (from "balanced to unbalanced", originally, but now derived from "balancing unit") [1] is an electrical device that allows balanced and unbalanced lines to be interfaced without disturbing the impedance arrangement of either line. [2] A balun can take many forms and may include devices that also transform impedances ...

  9. Unbalanced circuit - Wikipedia

    en.wikipedia.org/wiki/Unbalanced_circuit

    Many transmission lines are intrinsically an unbalanced format such as the widely used coaxial cable. In such cases the circuit can be directly connected to the line. However, connecting an unbalanced circuit to, for instance, a twisted pair line, which is an intrinsically balanced format, makes the line susceptible to common-mode interference.