Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable.

Jesús A. De Loera Steven Klee

Published in: Math. Oper. Res. (2012)

Keyphrases

transportation problem
integer programming
betti numbers
convex hull
lattice points
np complete
directed graph
valid inequalities
helmholtz principle
artificial neural networks
markov networks
undirected graph
neural network
markov random field
linear programming