The purpose of this paper is to develop a useful technique for solving linear programmes involving more than one objective function. Motivation for solving multicriterion linear programmes is given ...

Two teams found different ways for quantum computers to process nonlinear systems by first disguising them as linear ones.

Bruce L. Chalmers, The Remez Exchange Algorithm for Approximation With Linear Restrictions, Transactions of the American Mathematical Society, Vol. 223 (Oct., 1976), pp. 103-131 ...

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.