首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Efficient MIP formulation for optimal 1-for-N diversity coding
Institution:1. National Clinician Scholars Program, University of California (UCLA), Los Angeles, CA, USA;2. Department of Medicine, Cedars-Sinai Medical Center, Los Angeles, CA, USA;3. Department of Health Policy & Management, UCLA Fielding School of Public Health, Los Angeles, CA, USA;4. Division of General Internal Medicine & Health Services Research, UCLA, Los Angeles, CA, USA;5. Lewis Center for Regional Policy Studies at the UCLA Luskin School of Public Affairs, Los Angeles, CA, USA;6. Department of Community Health Sciences, UCLA Fielding School of Public Health, Los Angeles, CA, USA;7. Department of Obstetrics and Gynecology, Division of Maternal Fetal Medicine, Cedars Sinai Medical Center & Burnes and Allen Research Institute, Los Angeles, CA, USA;1. Department of City and Regional Planning, New East Building, CB# 3140, 223 E Cameron Ave, Chapel Hill, NC 27599-3140, USA;2. UNC Center for Health Equity Research, 323 MacNider Hall, 333 South Columbia Street, Chapel Hill, NC 27599-7240, USA
Abstract:In the paper we consider a communication network that uses diversity coding in order to achieve reliability. Having a set of demands and a network topology we face a problem of optimal routing of the demands and backup trees, and associations between the demands and the backup trees. We present a compact mixed integer programming (MIP) formulation for the optimization problem, which proves to be more efficient than other approaches that can be found in the literature.
Keywords:diversity coding  valid inequalities  mixed integer programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号