Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Fülöp, János and Muu, LD (2000) Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 105 (1). pp. 37-54.
Full text not available from this repository.| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 11 Dec 2012 15:06 |
| Last Modified: | 11 Dec 2012 15:06 |
| URI: | https://eprints.sztaki.hu/id/eprint/2436 |
 |
Update Item |
