A FPTAS for a class of linear multiplicative problems |
| |
| Authors: | Daniele Depetrini Marco Locatelli |
| |
| Affiliation: | 1.Dipartimento di Informatica,Università di Torino,Torino,Italy |
| |
| Abstract: | In this paper we consider the problem of minimizing the product of two affine functions over a polyhedral set. An approximation algorithm is proposed and it is proved that it is a Fully Polynomial Time Approximation Scheme. We will also present and computationally investigate an exact version of the algorithm. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
