Results 41 to 50 of about 211,682 (273)

Universally Balanced Combinatorial Optimization Games

Games, 2010
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization ...
Xiaotie Deng, Gabrielle Demange
doaj   +1 more source

Ant colony optimization and its application to the vehicle routing problem with pickups and deliveries [PDF]

, 2009
Ant Colony Optimization (ACO) is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems. It was first introduced for solving the Traveling Salesperson Problem. Since then many implementations of
Catay, Bulent, Çatay, Bülent
core   +1 more source

An Ising Machine Approach to the Personalized Course Selection Problem

IEEE Access
A combinatorial optimization problem is a problem finding an optimal combination of variables that maximizes or minimizes an objective function while satisfying given constraints.
Takeru Ota, Keisuke Fukada, Nozomu Togawa   +2 more
doaj   +1 more source

Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations [PDF]

, 2013
It was recently shown in [http://arxiv.org/abs/1207.5518] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility ...
Cai, Yang, Daskalakis, Constantinos, Weinberg, S. Matthew   +2 more
core   +5 more sources

Quantum Optimization for Combinatorial Searches

, 2002
I propose a "quantum annealing" heuristic for the problem of combinatorial search among a frustrated set of states characterized by a cost function to be minimized. The algorithm is probabilistic, with postselection of the measurement result.
Aharonov A, Bennett C H, Brassard G, C A Trugenberger, Dürr C, e.g. Holland J H, Fu Y, Kirkpatrick S, Mezard M, Shor P W, Steane A, Toulouse G, Ventura D   +12 more
core   +1 more source

Personalized Selumetinib Dosing in Pediatric Neurofibromatosis Type 1: Insights From a Pilot Therapeutic Drug Monitoring Study

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács, Zoltán Köllő, Balázs Gellért Karvaly, Mahmoud Obeidat, Rita Nagy, Péter Hegyi, Brigitta Teutsch, Eszter Tuboly, Miklós Garami   +8 more
wiley   +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

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

Adherence to Protocol Recommendations for Children With Wilms Tumour in Two Consecutive Studies in the United Kingdom and Ireland—Does Variation Matter?

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background and Aims Wilms tumour (WT) has excellent event‐free and overall survival (OS). However, small differences exist between countries participating in the same international study. This led us to examine variation in adherence to protocol recommendations as a potential contributing factor.
Suzanne Tugnait, R. Al‐Saadi, A. Lopez‐Cortes, K. Dzhuma, M. Oostveen, J. Brok, S. Irtan, M. Weeks, J. Bate, S. Baker, R. Williams, M. Powis, D. Saunders, O. Olsen, T. Watson, S. Shelmerdine, S. Vaidya, L. Howell, C. Duncan, G. M. Vujanic, C. Stiller, G. P. Balchin, T. Chowdhury, K. Pritchard‐Jones   +23 more
wiley   +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