Results 31 to 40 of about 39,679 (279)
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
Similarity-based parameter transferability in the quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda +10 more
doaj +1 more source
ABSTRACT Background/Objectives Osteosarcoma is a radioresistant tumor that may benefit from stereotactic body radiation therapy (SBRT) for locoregional control in metastatic/recurrent disease. We report institutional practice patterns, outcomes, toxicity, and failures in osteosarcoma patients treated with SBRT.
Jenna Kocsis +13 more
wiley +1 more source
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
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 +4 more
doaj +1 more source
Aplicación de la búsqueda tabú en regresión no lineal
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 +2 more
doaj +1 more source
Lifestyle Behaviors and Cardiotoxic Treatment Risks in Adult Childhood Cancer Survivors
ABSTRACT Background Higher doses of anthracyclines and heart‐relevant radiotherapy increase cardiovascular disease (CVD) risk. This study assessed CVD and CVD risk factors among adult childhood cancer survivors (CCSs) across cardiotoxic treatment risk groups and examined associations between lifestyle behaviors and treatment risks.
Ruijie Li +6 more
wiley +1 more source
A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine
Ising machines are promising alternatives to solve combinatorial optimization problems, which search for their quasi-optimal solutions with high speed and high accuracy.
Keisuke Fukada +3 more
doaj +1 more source
ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser +6 more
wiley +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source
ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül +2 more
wiley +1 more source

