Branch-and-bound for biobjective mixed-integer linear programming
Year of publication: |
2022
|
---|---|
Authors: | Adelgren, Nathan ; Gupte, Akshay |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 909-933
|
Subject: | branch-and-bound | fathoming rules | mixed-integer programming | multiobjective optimization | Pareto optima | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Mahmoodian, Vahid, (2022)
-
Multi-threaded simulated annealing for a bi-objective maintenance scheduling problem
Safaei, Nima, (2012)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
- More ...
-
Efficient storage of Pareto points in biobjective mixed integer programming
Adelgren, Nathan, (2018)
-
On convex multiobjective programs with application to portfolio optimization
Jayasekara, Pubudu L.W., (2019)
-
Analysis of MILP techniques for the pooling problem
Dey, Santanu S., (2015)
- More ...