Results 51 to 60 of about 63,688 (308)

Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems [PDF]

, 2021
Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems.
Ali Ahmid, Thien-My Dao, Ngan Van Le
core   +1 more source

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP

Tạp chí Khoa học Đại học Đà Lạt, 2017
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj   +1 more source

Incidence and Severity of Carboplatin‐Associated Hearing Loss in Children With Cancer Assessed by the SIOP Boston 2012 Ototoxicity Criteria

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Platinum‐based chemotherapy is known to cause severe and debilitating hearing loss, but unlike cisplatin, the true incidence of carboplatin‐induced hearing loss remains unclear. We evaluated functional hearing outcomes in children receiving carboplatin to determine the incidence and severity of ototoxicity. Procedure We identified a
Aniket Chawla, Sean Carter, Andrew Wood, Sandra Staffieri, Andrew Dodgshun, David D. Eisenstat, Michael Sullivan   +6 more
wiley   +1 more source

Multimode extensions of combinatorial optimization problems [PDF]

, 2016
We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the ...
Lulli, Guglielmo, G. Lulli, Cordone, Roberto, R. Cordone   +3 more
core   +1 more source

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems

IEEE Access
Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa, Ryoma Sasaki, Duckgyu Shin, Warren J. Gross, Takahiro Hanyu   +4 more
doaj   +1 more source

MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION

Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2011
The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets, Ye.M. Yemets, T.V. Chilikina   +2 more
doaj   +1 more source

Similarity-based parameter transferability in the quantum approximate optimization algorithm

Frontiers in Quantum Science and Technology, 2023
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda, Alexey Galda, Eesh Gupta, Eesh Gupta, Jose Falla, Jose Falla, Xiaoyuan Liu, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, Ilya Safro   +10 more
doaj   +1 more source

Association Between Dinutuximab Beta Exposure and Post‐End‐of‐Treatment Survival in Neuroblastoma: A Weighted Patient‐Level Analysis of Three Clinical Studies

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Objectives The association between exposure to dinutuximab beta (DB) and event‐free survival (EFS) or overall survival (OS) of neuroblastoma patients was assessed using data collected during three clinical trials (five cohorts). Methods A systematic review (March 2026) was conducted to identify relevant studies (prospective; registered DB ...
Przemysław Holko, Holger N. Lode, Alberto Garaventa, Carla Manzitti, Roberto Luksch, Dominique Valteau‐Couanet, Marion Gambart, John Anderson, Juliet Gray, Adela Canete, Lucas Moreno, Aleksandra Wieczorek, Cormac Owens, Shifra Ash, Isaac Yaniv, Genevieve Laureys, Hans Loibner, Katarzyna Śladowska, Ruth Ladenstein, Paweł Kawalec   +19 more
wiley   +1 more source

Aplicación de la búsqueda tabú en regresión no lineal

Revista de Matemática: Teoría y Aplicaciones, 2009
We implement the combinatorial optimization technique known as tabu search in the parameter estimation problem in a given non linear model. For the generation of neighbors, the implementation is based on a discretization of the parameter space, which is ...
Mario A. Villalobos, Javier Trejos Zelaya, Sergio Gerardo De los Cobos Silva   +2 more
doaj   +1 more source

Measurable Residual Disease Monitoring During Treatment for Pediatric Acute Myeloid Leukemia in First Relapse

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Survival after relapse in pediatric acute myeloid leukemia (AML) remains poor, highlighting the critical importance of identifying prognostic factors to guide optimal relapse management. Methods We investigated the prognostic impact of multiparameter flow cytometry (MFC) measurable residual disease (MRD) in 188 patients with first ...
Camilla Poulsen, Kristian Juul Sandahl, Lene Karlsson, Jonas Abrahamsson, Nira Arad‐Cohen, Daniel Cheuk, Barbara De Moerloose, Linda Fogelstrand, Jose Maria Fernandez Navarro, Bianca F. Goemans, Kirsi Jahnukainen, Gertjan Kaspers, Zhanna Kovalova, Monica Cheng Munthe‐Kaas, Ulrika Norén‐Nyström, Josefine Palle, Ramune Pasauliene, Cornelis Jan Pronk, Kadri Saks, Anne Tierens, Henrik Hasle, Kristian Løvvik Juul‐Dam   +21 more
wiley   +1 more source