Find link

language:

Find link is a tool written by Edward Betts.

searching for Alexander Schrijver 7 found (37 total)

Arborescence (graph theory) (748 words) [view diff] exact match in snippet view article

7th edition. McGraw-Hill Science. p. 747. ISBN 978-0-07-338309-5. Alexander Schrijver (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer

Linear programming (6,567 words) [view diff] exact match in snippet view article find links to article

(Graduate level) Alexander Schrijver (2003). Combinatorial optimization: polyhedra and efficiency. Springer. Alexander Schrijver, Theory of Linear and

Pseudo-Boolean function (1,139 words) [view diff] exact match in snippet view article find links to article

opposite to maximization of a submodular function which is NP-hard, Alexander Schrijver (2000). If f is a quadratic polynomial, a concept called roof duality

Tree (graph theory) (3,308 words) [view diff] exact match in snippet view article

7th edition. McGraw-Hill Science. p. 747. ISBN 978-0-07-338309-5. Alexander Schrijver (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer

Balanced matrix (868 words) [view diff] exact match in snippet view article find links to article

Mathematical Programming. 2: 19–31. doi:10.1007/BF01584535. S2CID 41468611. Alexander Schrijver (1998). Theory of Linear and Integer Programming. John Wiley & Sons

Petersen graph (2,926 words) [view diff] exact match in snippet view article find links to article

of cubic multigraphs", Discrete Math., 111: 11–17. László Lovász, Alexander Schrijver (1998), "A Borsuk theorem for antipodal links and a spectral characterization

Alexander Rinnooy Kan (727 words) [view diff] exact match in snippet view article find links to article

Programming, 46(1-3), 1-29. Lenstra, A. K., A. H. G. Rinnooy Kan, and Alexander Schrijver. "History of Mathematical Programming: A Collection of Personal Reminiscences