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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied mathematics and computation Jg. 171; H. 1; S. 53 - 71
Hauptverfasser:	Mavrotas, G., Diakoulaki, D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Elsevier Inc 01.12.2005 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!