Quantcast
Channel: User Rodrigo de Azevedo - MathOverflow
Viewing all articles
Browse latest Browse all 198

Comment by Rodrigo de Azevedo on Solve NP-hard type problems with linear programming

$
0
0
If you have a convex polytope whose vertices are integral, then you can solve integer programs via linear programming. But these are extremely special instances

Viewing all articles
Browse latest Browse all 198

Trending Articles