Abstract
Dynamic programming recursive equations are used to develop a procedure to obtain the set of efficient solutions to the multicriteria integer linear programming problem. An alternate method is produced by combining this procedure with branch and bound rules. Computational results are reported. © 1981 The Mathematical Programming Society.
Original language | English |
---|---|
Pages (from-to) | 204-223 |
Number of pages | 20 |
Journal | Mathematical Programming |
DOIs | |
Publication status | Published - 1 Jan 1981 |
Externally published | Yes |