Zobrazeno 1 - 10
of 52 191
pro vyhledávání: '"combinatorial optimization problems"'
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimization problems, generalizing the recently proposed Quantum Conic Programming (QCP) approach. Accordingly, it inherits many favorable properti
Externí odkaz:
http://arxiv.org/abs/2411.00435
Autor:
Garhofer, Simon, Bringmann, Oliver
The Quantum Approximate Optimization Algorithm (QAOA) and its derived variants are widely in use for approximating combinatorial optimization problem instances on gate-based Noisy Intermediate Scale Quantum (NISQ) computers. Commonly, circuits requir
Externí odkaz:
http://arxiv.org/abs/2412.07450
Publikováno v:
Memetic Computing 12:3-22, 2020
Memetic algorithms are techniques that orchestrate the interplay between population-based and trajectory-based algorithmic components. In particular, some memetic models can be regarded under this broad interpretation as a group of autonomous basic o
Externí odkaz:
http://arxiv.org/abs/2411.01922
Autor:
Sankaran, Prashant, McConky, Katie
Existing stochastic selection strategies for parent selection in generational GA help build genetic diversity and sustain exploration; however, it ignores the possibility of exploiting knowledge gained by the process to make informed decisions for pa
Externí odkaz:
http://arxiv.org/abs/2410.03863
Combinatorial optimization problems pose significant computational challenges across various fields, from logistics to cryptography. Traditional computational methods often struggle with their exponential complexity, motivating exploration into alter
Externí odkaz:
http://arxiv.org/abs/2409.13781
Combinatorial optimization problems play crucial roles in real-world applications, and many studies from a physics perspective have contributed to specialized hardware for high-speed computation. However, some combinatorial optimization problems are
Externí odkaz:
http://arxiv.org/abs/2409.03154
Autor:
Min, Yimeng
This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independent set, maximum cut, and vario
Externí odkaz:
http://arxiv.org/abs/2410.17111
Computationally challenging combinatorial optimization problems (COPs) play a fundamental role in various applications. To tackle COPs, many Ising machines and Quadratic Unconstrained Binary Optimization (QUBO) solvers have been proposed, which typic
Externí odkaz:
http://arxiv.org/abs/2410.14111
Maximin fairness is the ideal that the worst-off group (or individual) should be treated as well as possible. Literature on maximin fairness in various decision-making settings has grown in recent years, but theoretical results are sparse. In this pa
Externí odkaz:
http://arxiv.org/abs/2410.02589