New valid inequalities for the optimal communication spanning tree problem
Year of publication: |
2019
|
---|---|
Authors: | Agarwal, Yogesh Kumar ; Venkateshan, Prahalad |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 31.2019, 2, p. 268-284
|
Subject: | networks | optimization | integer programming | valid inequalities | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory |
-
Design of a wind farm collection network when several cable types are available
Hertz, Alain, (2017)
-
On the minimum-cost λ-edge-connected k-subgraph problem
Sadeghi, Elham, (2016)
-
MIP formulations for induced graph optimization problems : a tutorial
Melo, Rafael A., (2023)
- More ...
-
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Agarwal, Yogesh Kumar, (2020)
-
Train stop scheduling problem : an exact approach using valid inequalities and polar duality
Hamid, Faiz, (2024)
-
Simultaneous production and transportation problem : a case of additive manufacturing
Dwivedi, Gourav, (2023)
- More ...