Sign inJoin
Worst case analysis of greedy heuristics for integer programming with non-negative data
Sign up to use

Audiobook

Libro.fmAudiobooks.com

We may earn a commission. Learn more.

Worst case analysis of greedy heuristics for integer programming with non-negative data

Stanford University. Systems Optimization Laboratory, G. Dobson — 1980
Sign up to use
We give a worst case analysis for two greedy heuristics for the integer programming problem minimize cx, Ax> or = b, O

Audiobook

Libro.fmAudiobooks.com

We may earn a commission. Learn more.

No reviews yet.
Be the first to write one.

No highlights yet.
Be the first to share one.