Understanding and using linear programming

By Bernd Gärtner, Jirí Matousek. Universitext, 2007

447 citations recorded by the source corpus.

Subfields: Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/34f65deead7cd959896f7772d52e41bc81737f3d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. David Ellis
2. Ehud Friedgut
3. Haran Pilpel
4. Norihide Tokushige
5. Peter Borg

Citations in the corpus

• Intersecting Families of Permutations (2010, background): “By the strong duality theorem of linear programming (see [23]), this is unsolvable if and only if there exist ci,j ≥ 0 such that ∑”