New Valid Inequalities for the Optimal Communication Spanning Tree Problem

Yogesh Kumar Agarwal
Yogesh Kumar Agarwal
Decision Sciences, Indian Institute of Management, Prabandh Nagar, Lucknow 226013, India;
Search for more papers by this author
,
Prahalad Venkateshan
Prahalad Venkateshan
http://orcid.org/0000-0002-9566-7451
Indian Institute of Management, Vastrapur, Ahmedabad 380015, India
Search for more papers by this author

Yogesh Kumar Agarwal

Yogesh Kumar Agarwal

Decision Sciences, Indian Institute of Management, Prabandh Nagar, Lucknow 226013, India;

Search for more papers by this author

,

Prahalad Venkateshan

Prahalad Venkateshan

http://orcid.org/0000-0002-9566-7451

Indian Institute of Management, Vastrapur, Ahmedabad 380015, India

Search for more papers by this author

Published Online:17 Apr 2019https://doi.org/10.1287/ijoc.2018.0827

Supplemental Material

ijoc.2018.0827.sm1.pdf

cover image INFORMS Journal on Computing

Volume 31, Issue 2

Spring 2019

Pages 193-410

Article Information

Supplemental Material

Metrics

Information

Received:April 25, 2017
Accepted:March 27, 2018
Published Online:April 17, 2019

Copyright © 2019, INFORMS

Cite as

Yogesh Kumar Agarwal, Prahalad Venkateshan (2019) New Valid Inequalities for the Optimal Communication Spanning Tree Problem. INFORMS Journal on Computing 31(2):268-284.

https://doi.org/10.1287/ijoc.2018.0827

Keywords