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 | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Neto, Teresa, (2013)
-
Branch-and-bound for bi-objective integer programming
Parragh, Sophie N., (2019)
- More ...
-
Die Krise in der Soziologie : ein kritischer Reader zum 17. Deutschen Soziologentag
Krysmanski, Hans Jürgen, (1975)
-
Effect of vacancies and surfactants on the dynamics of ordering processes in multi-component systems
Gilhøj, Henriette, (1996)
-
Quantifying optimal mesh and ring design costs
Stidsen, Thomas, (2005)
- More ...