Sign in
Join Literal
Worst case analysis of greedy heuristics for integer programming with non-negative data
Stanford University. Systems Optimization Laboratory
Want to read
Sign up to use
Stanford University. Systems Optimization Laboratory
Worst case analysis of greedy heuristics for integer programming with non-negative data
Stanford University. Systems Optimization Laboratory,
G. Dobson
Want to read
Sign up to use
Want to read
Sign up to use
Overview
Reviews
Highlights
Editions
We give a worst case analysis for two greedy heuristics for the integer programming problem minimize cx, Ax> or = b, O
Discover more books like Worst case analysis of greedy heuristics for integer programming with non-negative data