Multi-objective branch and bound-Reference-Cited by-同舟云学术

Multi-objective branch and bound

Published:2017-08 Issue:3 Volume:260 Page:856-872
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Przybylski Anthony,Gandibleux Xavier

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference65 articles.

1. Bicriteria transportation problem;Aneja;Management Science,1979

2. Solving efficiently the 0–1 multi-objective knapsack problem;Bazgan;Computers & Operations Research,2009

3. Belotti, P. (2014). Personal communication.

4. A branch-and-bound algorithm for biobjective mixed-integer programs;Belotti,2013

5. A criterion space search algorithm for biobjective mixed integer programming: The triangle search method;Boland;INFORMS Journal on Computing,2015

Cited by 62 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Review on Multi-Objective Mixed-Integer Non-Linear Optimization Programming Methods;Eng;2024-08-17

2. On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem;Mathematical Methods of Operations Research;2024-08

3. Augmenting bi-objective branch and bound by scalarization-based information;Mathematical Methods of Operations Research;2024-04-15

4. Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming;Optimization Letters;2024-03-18

5. Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch;IEEE Access;2024