A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

We present an algorithm for generating a subset of non-dominated vectors of multiple objective mixed integer linear programming. Starting from an initial non-dominated vector, the procedure finds at each iteration a new one that maximizes the infinity-norm distance from the set dominated by the prev...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 180; číslo 3; s. 1011 - 1027
Hlavní autoři:	Sylva, John, Crema, Alejandro
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.08.2007 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Exact sciences and technology Integer programming Linear programming Mathematical programming Multiple objective programming Operational research and scientific management Operational research. Management science Parametric programming Studies Vector space Integer programming Multiple objective programming Parametric programming Linear programming Mixed integer programming Multiobjective programming
ISSN:	0377-2217, 1872-6860
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!