Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-9.)

Fülöp, János and Muu, LD (1998) Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-9.). MTA SZTAKI, Budapest, p. 16.

Full text not available from this repository.
Item Type: Book
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 14:54
Last Modified: 11 Dec 2012 14:54
URI: http://eprints.sztaki.hu/id/eprint/1702

Update Item Update Item