arrow
返回

Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs

delete2022-11-01
delete13
delete
OA
AI
S
Sune Lauth Gadegaard
L
Lars Relund Nielsen
DOI:10.1016/j.ejor.2022.01.047delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems. In the recent literature, competitive frameworks has been proposed for bi-objective 0-1 problems, and many of these frameworks rely on the use of the linear relaxation to obtain lower bound sets. When increasing the number of objective functions, however, the polyhedral structure of the linear relaxation becomes more complex, and consequently requires more computational effort to obtain. In this paper we overcome this obstacle by speeding up the computations. To do so, in each branching node we use information available from its father node to warm-start a Bensons-like algorithm. We show that the proposed algorithm significantly reduces the CPU time of the framework on several different problem classes with three, four and five objective functions. Moreover, we point out difficulties that arise when non-binary integer variables are introduced in the models, and test our algorithm on problem that contains non-binary integer variables too. (C) 2022 The Author(s). Published by Elsevier B.V.
Keyword:
Multiple objective programming
Branch and bound
Combinatorial optimization
Linear relaxation
Warm-starting
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

A
Aarhus University
学者数:
4.3W
论文数: 4.2W
被引数: 4.8W
引用论文

引用论文

Adolescent Depression Rating Scale--French Version
err2007-01-01
err0
PREAI
errAnne Revah-Levy; Boris Birmaher; Isabelle Gasquet; Bruno Falissard
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容