RAGE: A novel strategy for solving non-polynomial problems through the random generation of solutions and incremental reduction of the number of candidates: A case study applied to the design of the network infrastructure for connected vehicles

作者：

Highlights：

• Novel strategy for solving combinatorial problems.

• Strategy has the potential to support decisions near real-time systems.

• Applicable when we must select a subset of elements from a set.

• Linear complexity.

摘要

•Novel strategy for solving combinatorial problems.•Strategy has the potential to support decisions near real-time systems.•Applicable when we must select a subset of elements from a set.•Linear complexity.

论文关键词：Novel strategy for solving combinatorial problems,Computer networks,Networks with infrastructure,Vehicular networks,Infrastructure design

论文评审过程：Received 5 December 2021, Revised 3 September 2022, Accepted 21 September 2022, Available online 27 September 2022, Version of Record 6 October 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118900