Publicação
Bound Improving Sequences: A Tool for Discrete Programming
| dc.contributor.author | Bárcia, Paulo | |
| dc.date.accessioned | 2019-12-03T11:34:46Z | |
| dc.date.available | 2019-12-03T11:34:46Z | |
| dc.date.issued | 1984-04 | |
| dc.description.abstract | The purpose of this note is to report a new tool for discrete programming: Bound improving sequences. It consists on the construction of a sequence of bounds that, under appropriate conditions, converges in a finite number of steps to the optimal value of the objective function of the Problem studied. As a byproduct an optimal solution for that problem is produced. For the case of 0-1 LP's such a sequence can be efficiently computed. Examples, geometric interpretations and computational experience reports for this case are given. | pt_PT |
| dc.description.version | N/A | pt_PT |
| dc.identifier.citation | Bárcia, Paulo, Bound Improving Sequences: A Tool for Discrete Programming (April, 1984). FEUNL Working Paper Series No. 18 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10362/89159 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | no | pt_PT |
| dc.publisher | Nova SBE | pt_PT |
| dc.relation.ispartofseries | FEUNL Working Paper Series;18 | |
| dc.title | Bound Improving Sequences: A Tool for Discrete Programming | pt_PT |
| dc.type | working paper | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | workingPaper | pt_PT |