Abstract
AbstractIn this paper, we deal with two routing problems that integrate coverage and cardinality constraints to optimize the wireless sensor networks lifetime. Problems based on arborescence and cycle topologies are defined on the design of that kind of network. We propose configuration‐based linear integer programming formulations and devise column‐and‐row generation (CRG) algorithms to evaluate the bounds. Computational experiments showed that configuration‐based formulations dominate the formulations being compared and indicate CRG as an alternative to solve related location–allocation problems in transportation and telecommunication networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
