Split algorithms for multiobjective integer programming problems

We consider split algorithms that partition the objective function space into p or p−1 dimensional regions so as to search for nondominated points of multiobjective integer programming problems, where p is the number of objectives. We provide a unified approach that allows different split strategies...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 140; p. 105673
Main Authors:	Karsu, Özlem, Ulus, Firdevs
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.04.2022 Pergamon Press Inc
Subjects:	Algorithms Computing time Epsilon constraint scalarization Function space Integer programming Multiobjective discrete optimization Multiobjective integer programming Operations research Parameters Pascoletti–Serafini scalarization Weighted sum scalarization Pascoletti–Serafini scalarization Epsilon constraint scalarization Weighted sum scalarization Multiobjective integer programming Multiobjective discrete optimization
ISSN:	0305-0548, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!