Results 21 to 30 of about 4,919,639 (299)
Advances in Graph Neural Networks for Combinatorial Optimization Problems [PDF]
Combinatorial optimization, as an important branch of mathematical optimization, focuses on finding optimal solution within a finite discrete solution space.
ZHU Ye, DING Cangfeng, CAO Bohao, CHEN Kexin
doaj +1 more source
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems.
Tianyi Hao +5 more
doaj +1 more source
A Combinatorial Problem on Polynomials [PDF]
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 +2 more sources
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems [PDF]
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
On analytic problems of combinatorial structures
There is not abstract.
Eugenijus Manstavičius
doaj +3 more sources
On Some Optimization Problems on Permutations
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
A Combinatorial Problem in Geometry [PDF]
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
Editorial for the Special Issue on Combinatorial Optimization Problems [PDF]
First paragraph: In combinatorial optimization, the goal is to find an optimal solution, according to some objective function, from a discrete search space. These problems arise widely in industry and academia and, unfortunately, many of them are NP-hard
Chicano, Francisco +2 more
core +1 more source
Combinatorial problems in solving linear systems [PDF]
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. In virtually all cases there should be a notion of sparsity for a combinatorial problem to arise.
Ucar, Bora, Duff, Iain S.
core +1 more source
Quadratic programming and combinatorial minimum weight product problems [PDF]
We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (aTx+γ)(bTx+δ) under linear constraints Ax ≤d. Examples of such problems are combinatorial minimum weight product problems such as, e.g., the following: Given a ...
Finocchi, I. +9 more
core +2 more sources

