Blokh, David and Gutin, Gregory (1996) An approximate algorithm for combinatorial optimization problems with two parameters. Australasian Journal of Combinatorics, 14
Full text access: Open
We call a minimum time combinatorial optimization (MCRT) problem any problem that has a finite set P, finite family S of subsets of P, non-negative threshold h, and two non-negative real-valued functions y: P - R+ (say, cost) and x:P - R+ (say, time). We describe a very simple approximate algorithm for any MCRT problem. Though our algorithm is not polynomial in general, we provide some evidence that the algorithm may be fairly fast in many cases.
This is a Submitted version This version's date is: 1996 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/00ae800e-5367-422a-6c6e-392860562095/5/
Deposited by Research Information System (atira) on 03-Jul-2014 in Royal Holloway Research Online.Last modified on 03-Jul-2014