Optimization bounds from the branching dual
Year of publication: |
2020
|
---|---|
Authors: | Benadè, Gerdus ; Hooker, John |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 1, p. 3-15
|
Subject: | branching dual | dual bounds | minimum bandwidth | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Merchant commodity storage practice revisited
Secomandi, Nicola, (2015)
-
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
Anjos, Miguel F., (2021)
-
Merchant energy trading in a network
Nadarajah, Selvaprabu, (2018)
- More ...
-
Preference elicitation for participatory dudgeting
Benadè, Gerdus, (2021)
-
Political districting without geography
Benadè, Gerdus, (2022)
-
Fair and efficient online allocations
Benadè, Gerdus, (2024)
- More ...