Network Loading Problem : valid inequalities from 5- and higher partitions
Year of publication: |
November 2018
|
---|---|
Authors: | Agarwal, Y. K. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 99.2018, p. 123-134
|
Subject: | Network loading | p-Partition | Valid inequalities | Integer programming | Branch and bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Einkommensverteilung | Income distribution | Branch-and-Bound | Branch and Bound | Netzwerk | Network |
-
Lifting the knapsack cover inequalities for the knapsack polytope
Letchford, Adam N., (2020)
-
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Luiz, Thiago Alcântara, (2021)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
Survivable network design with shared-protection routing
Agarwal, Y. K., (2014)
-
Near optimal design of wavelength routed optical networks
Agarwal, Y. K., (2016)
-
Fixed charge multicommodity network design using p-partition facets
Agarwal, Y. K., (2017)
- More ...