Results 41 to 50 of about 63,688 (308)
Highly connected orientations from edge-disjoint rigid subgraphs
Forum of Mathematics, PiWe give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a k-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices.
Dániel Garamvölgyi +3 more
doaj +1 more source
On the Landscape of Combinatorial Optimization Problems [PDF]
IEEE Transactions on Evolutionary Computation, 2014 This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima.
Tayarani Najaran, Mohammad +1 more
openaire +3 more sources
Direct Combinatorial Pathway Optimization [PDF]
ACS Synthetic Biology, 2016 Combinatorial engineering approaches are becoming increasingly popular, yet they are hindered by the lack of specialized techniques for both efficient introduction of sequence variability and assembly of numerous DNA parts, required for the construction of lengthy multigene pathways.
Pieter Coussement +3 more
openaire +4 more sources
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems [PDF]
, 2021 Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time
Tapani Toivonen, Markku Tukiainen
core +1 more source
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
Bird Mating Optimizer for Combinatorial Optimization Problems
IEEE Access, 2020 The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +1 more source
Data-driven combinatorial optimization [PDF]
Tong, GuangmoCombinatorial optimization problems, particularly those within the NP-hard and NP-complete classes, pose significant challenges due to their believed intractability in polynomial time.
Samizadeh, Mina
core +1 more source
Algorithmic aspects of combinatorial discrepancy [PDF]
, 2014 This chapter describes some recent results in combinatorial discrepancy theory motivated by designing efficient polynomial time algorithms for finding low discrepancy colorings. Until recently, the best known results for several combinatorial discrepancy
Srivastav, A. +3 more
core +1 more source
An Ising Machine Approach to the Personalized Course Selection Problem
IEEE AccessA 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 +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source