Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case

This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch and bound algorithm for mixed 0-1 multiple objective linear programs. We first elaborate the issues encountered by the original algorithm and then propose a corrected version for the biobjective case using an...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 40; číslo 1; s. 498 - 509
Hlavní autoři:	Vincent, Thomas, Seipp, Florian, Ruzika, Stefan, Przybylski, Anthony, Gandibleux, Xavier
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.01.2013 Elsevier Pergamon Press Inc
Témata:	Algorithms Applied sciences Branch & bound algorithms Branch and bound Decision theory. Utility theory Dominance filtering Exact sciences and technology Linear programming Mathematical programming Multi-objective linear programming Multi-objective mixed integer programming Multiple criteria decision making Multiple objective Nondominated set Operational research and scientific management Operational research. Management science Operations research Representations Strategy Studies Nondominated set Dominance filtering Multi-objective mixed integer programming Branch and bound Multi-objective linear programming Mixed programming Branch and bound method Multiobjective programming Dominance Linear programming Mixed integer programming Zero one programming Filter Implicit enumeration method
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!