Results 61 to 70 of about 1,967,671 (302)
Combinatorial optimization with 2-joins
Journal of Combinatorial Theory, Series B, 2012 A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class ...
Trotignon, Nicolas, Kristina, Vuskovic
openaire +7 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Patients with chronic kidney disease undergoing hemodialysis commonly experience reduced physical function, fatigue, poor sleep quality, and impaired health‐related quality of life. Intradialytic exercise has been proposed as a non‐pharmacological strategy to improve these outcomes.
Klebson da Silva Almeida +6 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 +2 more
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Algorithms, 2018 We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation
Alexander A. Lazarev +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 +10 more
doaj +1 more source
Clustering and combinatorial optimization in recursive supervised learning
, 2007 The use of combinations of weak learners to learn a dataset has been shown to be better than the use of a single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has
Guan, S.U. +5 more
core +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent
Results in PhysicsCombinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi +5 more
doaj +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 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