Search Results - programming: internet algorithm branch and bound*

A MILP‐Based Optimization Framework for Joint Transmission Scheduling and Dynamic Channel Allocation in QoS‐Constrained IoT Networks.

Authors: Mazloomi, Neda Klidbary, Sajad Haghzad Zaretalab, Arash

Source: International Journal of Communication Systems. 11/10/2025, Vol. 38 Issue 16, p1-17. 17p.

Subject Terms: *QUALITY of service, *INTERNET of things, *CONSTRAINT programming, *DIGITAL communications, *MATHEMATICAL optimization, *BANDWIDTH allocation, *MACHINE-to-machine communications

Simplifying amino acid alphabets by means of a branch and bound algorithm and substitution matrices

Authors: CANNATA N TOPPO, STEFANO ROMUALDI, CHIARA et al.

Source: Bioinformatics. 18:1102-1108

Subject Terms: 0301 basic medicine, Internet, 0303 health sciences, Models, Statistical, Sequence Homology, Amino Acid, Decision Trees, Molecular Sequence Data, Information Storage and Retrieval, Sensitivity and Specificity, 03 medical and health sciences, Evaluation Studies as Topic, Sequence Analysis, Protein, Software Design, Database Management Systems, Programming Languages, Amino Acid Sequence, Databases, Protein, Algorithms

Access URL: https://academic.oup.com/bioinformatics/article-pdf/18/8/1102/634069/181102.pdf
https://pubmed.ncbi.nlm.nih.gov/12176833
http://www.ncbi.nlm.nih.gov/pubmed/12176833
https://academic.oup.com/bioinformatics/article-abstract/18/8/1102/233123
https://core.ac.uk/display/53424486
https://academic.oup.com/bioinformatics/article/18/8/1102/233123
http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics18.html#CannataTRV02
https://www.research.unipd.it/handle/11577/2429121
https://hdl.handle.net/11581/201339

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

Authors: Coudert, David Mazauric, Dorian Nisse, Nicolas

Contributors: Coudert, David Mazauric, Dorian Nisse, Nicolas

Source: ACM Journal of Experimental Algorithmics. 21:1-23

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/pdf

Access URL: https://hal.inria.fr/hal-01266496/file/babpw-20151120.pdf
https://inria.hal.science/hal-01266496v1
https://doi.org/10.1145/2851494
https://inria.hal.science/hal-01266496v1/document
https://hal.inria.fr/hal-01266496/document
https://dl.acm.org/doi/10.1145/2851494
https://dblp.uni-trier.de/db/journals/jea/jea21.html#CoudertMN16
https://hal.inria.fr/hal-01266496

Interval carbon emission flow model and bi-level branch-and-bound algorithm for power systems considering renewable energy uncertainty.

Authors: Shen, Haoning Ding, Tao Mu, Chenggang et al.

Source: Energy. Oct2025, Vol. 333, pN.PAG-N.PAG. 1p.

Subject Terms: *LINEAR programming, *CARBON emissions, *RENEWABLE energy sources, *TEST systems, *ALGORITHMS

Green Large-Scale Fog Computing Resource Allocation Using Joint Benders Decomposition, Dinkelbach Algorithm, ADMM, and Branch-and-Bound

Authors: Ye Yu Xiangyuan Bu Kai Yang et al.

Source: IEEE Internet of Things Journal. 6:4106-4117

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 7. Clean energy

Access URL: https://ieeexplore.ieee.org/document/8489879/
https://doi.org/10.1109/JIOT.2018.2875587
https://dblp.uni-trier.de/db/journals/iotj/iotj6.html#YuBYWH19

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Authors: Martello, Silvano Pisinger, David Toth, Paolo

Source: Management Science, 1999 Mar 01. 45(3), 414-424.

Access URL: https://www.jstor.org/stable/2634886

Analysis of a Dominant Retailer Dual-Channel Supply Chain under Customers' Channel Preference: The a- Branch and Bound Solution Algorithm.

Authors: Mehrabani, Reza Pakdel Seifi, Abbas

Source: Iranian Journal of Management Studies. Autumn2019, Vol. 12 Issue 4, p559-591. 36p.

Subject Terms: *SUPPLY chains, *WHOLESALE prices, *INTERNET stores, *RETAIL industry, BRANCH & bound algorithms

Neural Branching Power-Computation Network Fast Optimization Method Considering Computing Demand Response

Authors: ZHANG Lei, LI Ran, TANG Lun, CHEN Sijie, ZHAO Shizhen, SU Fu

Source: Shanghai Jiaotong Daxue xuebao, Vol 59, Iss 11, Pp 1592-1602 (2025)

Subject Terms: mixed integer linear programming (milp), unit commitment, demand response, internet data center (idc), neural branching, Engineering (General). Civil engineering (General), TA1-2040, Chemical engineering, TP155-156, Naval architecture. Shipbuilding. Marine engineering, VM1-989

File Description: electronic resource

Relation: https://xuebao.sjtu.edu.cn/article/2025/1006-2467/1006-2467-59-11-1592.shtml; https://doaj.org/toc/1006-2467

Access URL: https://doaj.org/article/c457e7f6996f49b9ba4791f85ec766b6

Device Scheduling for Secure Aggregation in Wireless Federated Learning

Authors: Na Yan Kezhi Wang Kangda Zhi et al.

Source: IEEE Internet of Things Journal. 11:28851-28862

Subject Terms: device scheduling, branch-and-bound (BnB), integer nonlinear fractional programming, federated learning (FL)

File Description: Electronic

Access URL: https://bura.brunel.ac.uk/handle/2438/29160

Design and Optimization of Traffic-Aware TSCH Scheduling for Mobile 6TiSCH Networks

Authors: Tavallaie, Omid Taheri, Javid Zomaya, Albert Y.

Source: IoTDI 2021 - Proceedings of the 2021 International Conference on Internet-of-Things Design and Implementation. :234-246

Subject Terms: Internet of Things (IoT), Mixed-Integer Convex Programming (MICP), Time-Slotted Channel Hopping (TSCH), Convex optimization, Integer programming, Internet of things, Lagrange multipliers, Medium access control, Multipath fading, Scheduling, Titanium compounds, Branch-and-bound algorithms, Contiki operating systems, Design and optimization, Mixed integer convex programming, Packet delivery ratio, State-of-the-art methods, Wireless interference, Branch and bound method, Datavetenskap, Computer Science

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85346

A Fuzzy Multi-Objective Sustainable and Agile Supply Chain Model Based on Digital Twin and Internet of Things with Adaptive Learning Under Environmental Uncertainty.

Authors: Nozari, Hamed Szmelter-Jarosz, Agnieszka Weiland, Dariusz

Source: Applied Sciences (2076-3417); Oct2025, Vol. 15 Issue 19, p10399, 25p

Subject Terms: DIGITAL twin, INTERNET of things, REINFORCEMENT learning, SUPPLY chain management, ENVIRONMENTAL risk, MULTI-objective optimization, SUPPLY chains, MATHEMATICAL optimization

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth

Authors: Coudert, David Mazauric, Dorian Nisse, Nicolas

Contributors: Coudert, David Mazauric, Dorian Nisse, Nicolas

Source: Lecture Notes in Computer Science ISBN: 9783319079585

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0211 other engineering and technologies, branch-and-bound, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Pathwidth, 0102 computer and information sciences, 02 engineering and technology, vertex-separation, Sage, 01 natural sciences

File Description: application/pdf

Access URL: https://hal.inria.fr/hal-00943549/file/RR-8470.pdf
https://inria.hal.science/hal-00943549v1
https://inria.hal.science/hal-00966851v1
https://core.ac.uk/display/52779165
https://hal.inria.fr/hal-00943549/document
https://dblp.uni-trier.de/db/conf/wea/sea2014.html#CoudertMN14
https://link.springer.com/chapter/10.1007/978-3-319-07959-2_5
https://rd.springer.com/chapter/10.1007/978-3-319-07959-2_5
https://hal.inria.fr/hal-00943549

Proposal and evaluation of channel assignment algorithms for wireless local area networks with opportunistic spectrum acces capabilities

Authors: Novillo Parales, Francisco Vicente

Contributors: University/Department: Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions

Thesis Advisors: Ferrús Ferré, Ramon

Source: TDX (Tesis Doctorals en Xarxa)

Time: 621.3

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/119320
https://dx.doi.org/10.5821/dissertation-2117-94942

Single-leader multi-follower games for the regulation of two-sided mobility-as-a-service markets.

Authors: Xi, Haoning Aussel, Didier Liu, Wei et al.

Source: European Journal of Operational Research. Sep2024, Vol. 317 Issue 3, p718-736. 19p.

Subject Terms: *MATHEMATICAL programming, *WIRELESS Internet, BILEVEL programming, MATHEMATICAL reformulation, GLOBAL optimization

A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations

Authors: Franz Rendl Giovanni Rinaldi Angelika Wiegele et al.

Contributors: Franz Rendl Giovanni Rinaldi Angelika Wiegele et al.

Source: http://www.optimization-online.org/DB_FILE/2006/11/1528.pdf.

Subject Terms: branch and bound algorithms, graph and network algorithms, integer programming, semidefinite programs

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2115

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2115
http://www.optimization-online.org/DB_FILE/2006/11/1528.pdf

Parallel Branch and Bound Algorithms on Internet Connected Workstations.

Authors: Yang, Laurence T. Rana, Omer F. Martino, Beniamino et al.

Source: High Performance Computing & Communications. 2005, p768-775. 8p.

An Approach for Autonomous Feeding Robot Path Planning in Poultry Smart Farm.

Authors: Zhang, Yanjun Sun, Weiming Yang, Jian et al.

Source: Animals (2076-2615); Nov2022, Vol. 12 Issue 22, p3089, 22p

Subject Terms: ROBOTIC path planning, POULTRY farms, BRANCH & bound algorithms, ENERGY consumption, LABOR demand, POULTRY processing, AUTONOMOUS robots, POTENTIAL field method (Robotics)

A Neural Separation Algorithm for the Rounded Capacity Inequalities.

Authors: Kim, Hyeonah Park, Jinkyoo Kwon, Changhyun

Source: INFORMS Journal on Computing. Jul/Aug2024, Vol. 36 Issue 4, p987-1005. 19p.

Subject Terms: *GRAPH neural networks, *ARTIFICIAL intelligence, *VEHICLE routing problem, *GRAPH algorithms, *INTEGER programming

About the Object-Oriented Implementation of the Branch and Boundary Method for the Travelling Salesman Problem. Part II

Authors: Boris Melnikov

Source: Современные информационные технологии и IT-образование, Vol 18, Iss 3, Pp 644-654 (2022)

Subject Terms: optimization problem, traveling salesman problem, heuristic algorithm, bran¬ches and bounds method, c++, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: http://sitito.cs.msu.ru/index.php/SITITO/article/view/915; https://doaj.org/toc/2411-1473

Access URL: https://doaj.org/article/a51209e37f9541adb0f5176845952206

Preventive Planning of 'Product-as-a-Service' Offers Using Genetic Population-Driven Stepping Crawl Threads.

Authors: Niemiec, Krzysztof Szwarc, Eryk Bocewicz, Grzegorz et al.

Source: Electronics (2079-9292); Dec2024, Vol. 13 Issue 23, p4710, 28p

Subject Terms: LINEAR programming, BUDGET, RESOURCE allocation, CONSUMERS, SCALABILITY