Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems

Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation of the Pareto front challenging. The present article shows that certain algorithms that were originally devised for continuous problems can be...

Full description

Bibliographic Details

Published in:	Engineering optimization Vol. 54; no. 8; pp. 1413 - 1425
Main Authors:	Burachik, Regina S., Kaya, C. Yalçın, Rizvi, Mohammed Mustafa
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 03.08.2022 Taylor & Francis Ltd
Subjects:	Algorithms Integer programming Mixed integer mixed-integer programming Multi-objective optimization numerical methods Pareto front scalarization
ISSN:	0305-215X, 1029-0273
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!