Výsledky vyhledávání - programming: internet algorithm branch and bound~
-
1
Green Large-Scale Fog Computing Resource Allocation Using Joint Benders Decomposition, Dinkelbach Algorithm, ADMM, and Branch-and-Bound
ISSN: 2327-4662, 2327-4662Vydáno: Piscataway IEEE 01.06.2019Vydáno v IEEE internet of things journal (01.06.2019)“… 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…”
Získat plný text
Journal Article -
2
An Output Space Branch-and-Bound Algorithm for Solving the Sum of Convex Quadratic-over-Linear Fractions Problem
ISSN: 2194-668X, 2194-6698Vydáno: 12.09.2025Vydáno v Journal of the Operations Research Society of China (Internet) (12.09.2025)Získat plný text
Journal Article -
3
A Second-order Cone Relaxation-Based Branch-and-Bound Algorithm for Complex Quadratic Programs on Acyclic Graphs
ISSN: 2194-668X, 2194-6698Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2025Vydáno v Journal of the Operations Research Society of China (Internet) (01.12.2025)“… Then, based on the proposed second-order cone relaxation, a branch-and-bound algorithm is developed…”
Získat plný text
Journal Article -
4
New Metaheuristics to Solve the Internet Shopping Optimization Problem with Sensitive Prices
ISSN: 2297-8747, 1300-686X, 2297-8747Vydáno: Basel MDPI AG 01.12.2024Vydáno v Mathematical and computational applications (01.12.2024)“… 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…”
Získat plný text
Journal Article -
5
MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound
ISSN: 2194-668X, 2194-6698Vydáno: Heidelberg Springer Nature B.V 01.03.2025Vydáno v Journal of the Operations Research Society of China (Internet) (01.03.2025)“…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…”
Získat plný text
Journal Article -
6
A MILP‐Based Optimization Framework for Joint Transmission Scheduling and Dynamic Channel Allocation in QoS‐Constrained IoT Networks
ISSN: 1074-5351, 1099-1131Vydáno: Chichester Wiley Subscription Services, Inc 10.11.2025Vydáno v International journal of communication systems (10.11.2025)“…‐Integer Linear Programming (MILP)‐based optimization framework that jointly addresses transmission scheduling and dynamic channel allocation. A tailored Branch…”
Získat plný text
Journal Article -
7
Joint Road Side Units Selection and Resource Allocation in Vehicular Edge Computing
ISSN: 0018-9545, 1939-9359Vydáno: New York IEEE 01.12.2021Vydáno v IEEE transactions on vehicular technology (01.12.2021)“… 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…”
Získat plný text
Journal Article -
8
Intelligent and Fair IoV Charging Service Based on Blockchain With Cross-Area Consensus
ISSN: 1524-9050, 1558-0016Vydáno: New York IEEE 01.12.2023Vydáno v IEEE transactions on intelligent transportation systems (01.12.2023)“…The emergence of electric vehicles promotes the development of Internet of Vehicle (IoV…”
Získat plný text
Journal Article -
9
Joint Network Admission Control, Mode Assignment, and Power Allocation in Energy Harvesting Aided D2D Communication
ISSN: 1551-3203, 1941-0050Vydáno: Piscataway IEEE 01.03.2020Vydáno v IEEE transactions on industrial informatics (01.03.2020)“…Green communication with sustainable energy is being considered for 5G cellular network and Internet of Things (IoT…”
Získat plný text
Journal Article -
10
Integrated Multicast and Unicast Transmission in IRS-NOMA Networks
ISSN: 0018-9545, 1939-9359Vydáno: New York IEEE 01.04.2023Vydáno v IEEE transactions on vehicular technology (01.04.2023)“… 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…”
Získat plný text
Journal Article -
11
Slicing Resource Allocation for eMBB and URLLC in 5G RAN
ISSN: 1530-8669, 1530-8677Vydáno: Cairo, Egypt Hindawi Publishing Corporation 2020Vydáno v Wireless communications and mobile computing (2020)“… A mixed-integer programming problem is formulated by maximizing the spectral efficiency of the system in the constraint of users…”
Získat plný text
Journal Article -
12
Joint Optimization of Cooperative Edge Caching and Radio Resource Allocation in 5G-Enabled Massive IoT Networks
ISSN: 2327-4662, 2327-4662Vydáno: Piscataway IEEE 15.09.2021Vydáno v IEEE internet of things journal (15.09.2021)“…The fifth-generation of wireless communication (5G) is a promising paradigm toward massive interconnectivity within Internet-of-Things (IoT) networks…”
Získat plný text
Journal Article -
13
An Integrated Pricing, QoS-Aware Sensor Location Model for Security Protection in Society 5.0
ISSN: 0018-9391, 1558-0040Vydáno: New York IEEE 01.11.2023Vydáno v IEEE transactions on engineering management (01.11.2023)“… 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…”
Získat plný text
Journal Article -
14
A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks
ISSN: 1550-1329, 1550-1477, 1550-1477Vydáno: London, England SAGE Publications 01.01.2014Vydáno v International journal of distributed sensor networks (01.01.2014)“… We develop a branch and bound (B&B) algorithm to solve the problem optimally. We verify by computational experiments that the proposed…”
Získat plný text
Journal Article -
15
ADMM-based problem decomposition scheme for vehicle routing problem with time windows
ISSN: 0191-2615, 1879-2367Vydáno: Oxford Elsevier Ltd 01.11.2019Vydáno v Transportation research. Part B: methodological (01.11.2019)“…•A coherent iterative solution approach for simultaneously generating upper bound and lower bound solutions…”
Získat plný text
Journal Article -
16
A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints
ISSN: 1024-123X, 1563-5147Vydáno: Cairo, Egypt Hindawi Publishing Corporation 01.01.2015Vydáno v Mathematical problems in engineering (01.01.2015)“… 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…”
Získat plný text
Journal Article -
17
Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming
ISSN: 2194-668X, 2194-6698Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023Vydáno v Journal of the Operations Research Society of China (Internet) (01.09.2023)“… 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…”
Získat plný text
Journal Article -
18
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
ISSN: 0025-1909, 1526-5501Vydáno: Linthicum, MD INFORMS 01.03.1999Vydáno v Management science (01.03.1999)“… than 0.2 seconds on a HP9000-735/99 computer. The C language implementation of the algorithm is available on the internet…”
Získat plný text
Journal Article -
19
Value-Based Hierarchical Information Collection for AUV-Enabled Internet of Underwater Things
ISSN: 2327-4662, 2327-4662Vydáno: Piscataway IEEE 01.10.2020Vydáno v IEEE internet of things journal (01.10.2020)“…The Internet of Underwater Things (IoUT) shows great potential in realizing the smart ocean…”
Získat plný text
Journal Article -
20
Energy-Efficient Resource Allocation and Subchannel Assignment for NOMA-Enabled Multiaccess Edge Computing
ISSN: 1932-8184, 1937-9234Vydáno: New York IEEE 01.03.2022Vydáno v IEEE systems journal (01.03.2022)“… On one hand, we investigate the hidden convexity of the resource allocation subproblem under the optimal conditions, and propose an efficient algorithm to optimally…”
Získat plný text
Journal Article