Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming

The paper describes the Multi-Criteria Branch and Bound (MCBB) algorithm, a vector maximization algorithm capable of deriving all efficient extreme points, for small- and medium-sized Mixed 0-1 Multiple Objective Linear Programming (Mixed 0-1 MOLP). Particular emphasis is given to computational aspe...

Full description

Saved in:

Bibliographic Details
Published in:	Applied mathematics and computation Vol. 171; no. 1; pp. 53 - 71
Main Authors:	Mavrotas, G., Diakoulaki, D.
Format:	Journal Article
Language:	English
Published:	New York, NY Elsevier Inc 01.12.2005 Elsevier
Subjects:	Branch and bound Calculus of variations and optimal control Exact sciences and technology Mathematical analysis Mathematics Mixed integer programming Multiple objective programming Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Numerical methods in optimization and calculus of variations Sciences and techniques of general use Branch and bound Mixed integer programming Multiple objective programming Integer programming Numerical analysis Maximization Algorithm performance Mixed programming Applied mathematics Decision making Multiobjective programming Linear programming
ISSN:	0096-3003, 1873-5649
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!