Results 21 to 30 of about 28,946 (263)
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem.
Cigdem Alabas-Uslu, Berna Dengiz
doaj +1 more source
A Combinatorial Problem on Polynomials [PDF]
Discrete & Computational Geometry, 1998 In 1973 G. A. Freiman described the structure of \(n\)-element sets \(A\subset \mathbb{R}\) for which \(| A+A|\leq C_n\): He proved that \(A\) must be contained in a ``generalized'' arithmetic progression. Here the author studies polynomials of two real variables which behave like \(x+y\), i.e. which can take only few distinct values when \(x\) and \(y\
openaire +1 more source
On Some Optimization Problems on Permutations
Кібернетика та комп'ютерні технології, 2022 Numerous studies consider combinatorial optimization problems and their solution methods, since a large number of practical problems are described by means of combinatorial optimization models.
Georgy Donets, Vasyl Biletskyi
doaj +1 more source
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Applications of Modelling and Simulation, 2023 The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan +4 more
doaj
Combinatorial Problems on H-graphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 Biró, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. We continue the study of these graph classes by considering coloring, clique, and isomorphism problems ...
Steven Chaplick, Peter Zeman 0001
openaire +2 more sources
A Combinatorial Problem in Geometry [PDF]
, 2009 Il s'agit d`une généralisation du problème suivant: Parmi 5 points dans un plan, dont il n'y en a pas 3 en ligne droite, on peut toujours en choisir 4 comme sommets d'un quadrilatère convexe. --- La généralisation proposée, scindée en deux questions, est la suivante: a) Peut-on déterminer un nombre \(N(n)\) de points dans le plan, suffisant pour que ...
Erdős, Pál, Szekeres, George
openaire +2 more sources
Quantum computational phase transition in combinatorial problems
npj Quantum Information, 2022 Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers.
Bingzhi Zhang, Akira Sone, Quntao Zhuang
doaj +1 more source
Discrete Mathematics, 1993 There are many interesting and sophisticated problems raised in the IMO, Putnam and other olympiads. Some of these problems have deep mathematical background, nice generalizations, and lead to new areas of research in combinatorics. In this paper several topics in this category (disjoint simplices, alternating simple path problems, balanced colorings, \
Jin Akiyama +2 more
openaire +2 more sources
Building Geometry Generation Example Applying GPT Models
ArchitectureThe emergence of large language models (LLMs) has opened new avenues for integrating artificial intelligence into architectural design workflows. This paper explores the feasibility of applying generative AI to solve a classic combinatorial problem ...
Zsolt Ercsey, Tamás Storcz
doaj +1 more source
Discrete Mathematics, 2001 A \(T\)-partition of \([n]=\{1, \dots, n\}\), \(n\geq 2\), is a 2-partition \(\{X,Y\}\) where, for every \(k\in\{1, \dots, n-1\}\), there exist \(i\in X\), \(j\in Y\), such that \(|i-j|=k\). The author here addresses the problem of counting the number of elements in \(T_n\), the set of \(T\)-partitions of \([n]\), and checking the asymptotic behavior ...
openaire +2 more sources