A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs-Reference-Cited by-同舟云学术

A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs

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

Author:

Cacchiani Valentina^ORCID,D’Ambrosio Claudia

Publisher

Elsevier BV

Subject

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

Reference59 articles.

1. Scip: solving constraint integer programs;Achterberg;Mathematical Programming Computation,2009

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

3. A branch-and-bound algorithm for biobjective mixed-integerprograms;Belotti;Optimization Online,2013

4. A criterion space search algorithm for biobjective integer programming: The balanced box method;Boland;INFORMS Journal on Computing,2015

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

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

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

2. An approximation algorithm for multiobjective mixed-integer convex optimization;Mathematical Methods of Operations Research;2024-07-29

3. Multi-objective branch-and-bound for the design-for-control of water distribution networks with global bounds;Structural and Multidisciplinary Optimization;2024-05

4. A novel Physarum-inspired competition algorithm for discrete multi-objective optimisation problems;Soft Computing;2023-06-26

5. A Hybrid Algorithm of Ant Colony and Benders Decomposition for Large-Scale Mixed-Integer Linear Programming;International Journal of Information Technology & Decision Making;2023-05-05