A branch and bound algorithm for a class of biobjective mixed integer programs
Year of publication: |
2014
|
---|---|
Authors: | Stidsen, Thomas ; Andersen, Kim Allan ; Dammann, Bernd |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 60.2014, 4, p. 1009-1032
|
Subject: | biobjective optimization | integer programming | branch and bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
Neto, Teresa, (2013)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Wang, Guanglei, (2019)
- More ...
-
Stidsen, Thomas, (2018)
-
A strategic view of university timetabling
Lindahl, Michael, (2018)
-
Quantifying optimal mesh and ring design costs
Stidsen, Thomas, (2005)
- More ...