Suchergebnisse - programming: internet algorithm branch AND bound*

Green Large-Scale Fog Computing Resource Allocation Using Joint Benders Decomposition, Dinkelbach Algorithm, ADMM, and Branch-and-Bound von Yu, Ye, Bu, Xiangyuan, Yang, Kai, Wu, Zhikun, Han, Zhu

“… The proposed problem is a large-scale mixed integer nonlinear programming. To deal with such kind of problems, we design an algorithm framework to solve the problem in a distributed and parallel manner …”
Volltext

An Output Space Branch-and-Bound Algorithm for Solving the Sum of Convex Quadratic-over-Linear Fractions Problem von Huang, Xiao-Li, Gao, Yue-Lin, Ma, Xiao-Hua, Liu, Xia

Volltext

A Second-order Cone Relaxation-Based Branch-and-Bound Algorithm for Complex Quadratic Programs on Acyclic Graphs von Liu, Yang-He, Xu, Ying-Zhe, Lu, Cheng, Deng, Zhi-Bin

“… Then, based on the proposed second-order cone relaxation, a branch-and-bound algorithm is developed …”
Volltext

MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound von Huang, Meng-Yu, Huang, Ling-Ying, Zhong, Yu-Xing, Yang, Hui-Wen, Chen, Xiao-Meng, Huo, Wei, Wang, Jia-Zheng, Zhang, Fan, Bai, Bo, Shi, Ling

“… Mixed integer linear programming (MILP) is an NP-hard problem, which can be solved by the branch and bound algorithm by dividing the original problem into several subproblems and forming a search tree …”
Volltext

Joint Road Side Units Selection and Resource Allocation in Vehicular Edge Computing von Li, Shichao, Zhang, Ning, Chen, Hongbin, Lin, Siyu, Dobre, Octavia A., Wang, Haitao

“… For the former, as the formulated problem is a mixed-integer nonlinear programming problem, we re-formulate the original problem into a convex one and then decompose it into a distributed manner …”
Volltext

ADMM-based problem decomposition scheme for vehicle routing problem with time windows von Yao, Yu, Zhu, Xiaoning, Dong, Hongyu, Wu, Shengnan, Wu, Hailong, Carol Tong, Lu, Zhou, Xuesong

“… •A coherent iterative solution approach for simultaneously generating upper bound and lower bound solutions …”
Volltext

A MILP‐Based Optimization Framework for Joint Transmission Scheduling and Dynamic Channel Allocation in QoS‐Constrained IoT Networks von Mazloomi, Neda, Klidbary, Sajad Haghzad, Zaretalab, Arash

“… ‐Integer Linear Programming (MILP)‐based optimization framework that jointly addresses transmission scheduling and dynamic channel allocation. A tailored Branch …”
Volltext

New Metaheuristics to Solve the Internet Shopping Optimization Problem with Sensitive Prices von García-Morales, Miguel A., Brambila-Hernández, José Alfredo, Fraire-Huacuja, Héctor J., Frausto, Juan, Cruz, Laura, Gómez, Claudia, Peña-Ramos, Alfredo

“… We assess the effectiveness of the proposed algorithms by comparing them with the Branch and Bound algorithm, which presents the most favorable outcomes of the state …”
Volltext

Intelligent and Fair IoV Charging Service Based on Blockchain With Cross-Area Consensus von Li, Dawei, Chen, Ruonan, Wan, Qinjun, Guan, Zhenyu, Li, Shizhong, Xie, Min, Su, Jieyu, Liu, Jianwei

“… The emergence of electric vehicles promotes the development of Internet of Vehicle (IoV …”
Volltext

Joint Network Admission Control, Mode Assignment, and Power Allocation in Energy Harvesting Aided D2D Communication von Awan, Asfand Yar, Ali, Mudassar, Naeem, Muhammad, Qamar, Farhan, Sial, Muhammad Nadeem

“… Green communication with sustainable energy is being considered for 5G cellular network and Internet of Things (IoT …”
Volltext

Integrated Multicast and Unicast Transmission in IRS-NOMA Networks von Xie, Ye, Ding, Zhiguo, Dai, Xuchu

“… The corresponding formulated problem is a nonconvex quadratically constrained quadratic program (QCQP), which is NP-hard. We propose a global optimal algorithm based on branch and bound …”
Volltext

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem von Martello, Silvano, Pisinger, David, Toth, Paolo

“… than 0.2 seconds on a HP9000-735/99 computer. The C language implementation of the algorithm is available on the internet …”
Volltext

Slicing Resource Allocation for eMBB and URLLC in 5G RAN von Wang, Dong, Wang, Fanggang, Zhang, Yong, Ma, Tengteng, Guo, Da

“… A mixed-integer programming problem is formulated by maximizing the spectral efficiency of the system in the constraint of users …”
Volltext

Joint Optimization of Cooperative Edge Caching and Radio Resource Allocation in 5G-Enabled Massive IoT Networks von Zhang, Fan, Han, Guangjie, Liu, Li, Martinez-Garcia, Miguel, Peng, Yan

“… The fifth-generation of wireless communication (5G) is a promising paradigm toward massive interconnectivity within Internet-of-Things (IoT) networks …”
Volltext

An Integrated Pricing, QoS-Aware Sensor Location Model for Security Protection in Society 5.0 von Fathi, Mahdi, Marufuzzaman, Mohammad, Buchanan, Randy K., Rinaudo, Christina H., Houte, Kayla M., Bian, Linkan

“… The role of sensors in Society 5.0 is critical. Sensors and the Internet of Things can be considered to work as a service system …”
Volltext

Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming von Jiao, Hong-Wei, Shang, You-Lin

“… and its subproblems into a series of linear programming relaxation problems. Based on the branch-and-bound framework and linear programming relaxation problems, a branch-and-bound …”
Volltext

Value-Based Hierarchical Information Collection for AUV-Enabled Internet of Underwater Things von Duan, Ruiyang, Du, Jun, Jiang, Chunxiao, Ren, Yong

“… The Internet of Underwater Things (IoUT) shows great potential in realizing the smart ocean …”
Volltext

A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints von Ito, Takao, Kao, Yonggui, Wang, Song, Hu, Shicheng, Sun, Xuedong

“… In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB) is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented …”
Volltext

Accelerating the Branch and Bound Algorithm for Solving the Extended Trust-Region Subproblems von Dai, Jin-Yu

Volltext

A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks von Rebai, Maher, Le Berre, Matthieu, Hnaien, Faicel, Snoussi, Hichem, Khoukhi, Lyes

“… We develop a branch and bound (B&B) algorithm to solve the problem optimally. We verify by computational experiments that the proposed …”
Volltext