An algorithm for the solution of the general set-covering problem by Euclidean means
Main Author: | Cullen, Frank Haywood |
---|---|
Published: |
Georgia Institute of Technology
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/25515 |
Similar Items
-
Continuous and integer generalized flow problems
by: Langley, Robert Warren
Published: (2008) -
A heuristic for minimum set covers using plausibility ordered searches /
by: Doherty, Michael Emmett
Published: (1974) -
A parallel processing system to solve the 0-1 programming problem /
by: Desai, Bipin C.
Published: (1977) -
Solution Algorithm for a New Bi-Level Discrete Network Design Problem
by: Qun Chen, et al.
Published: (2013-12-01) -
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01)