This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting ...
School of Power and Energy, Nanchang Hangkong University, Nanchang, China. China’s aviation industry, particularly its civil aviation sector, is undergoing rapid development, with the fleet of civil ...
Abstract: The Quadratic Assignment Problem (QAP) is a well-studied, NP-Hard combinatorial optimization problem with practical applications in timetabling, scheduling, logistics, circuit design and ...
In a standard paper assignment setting, a set $\mathcal{P}$ of $n^{(p)}$ papers needs to be assigned to a set $\mathcal{R}$ of $n^{(r)}$ reviewers. To ensure each ...
LLM4AD is an open-source Python-based Platform leveraging Large Language Models (LLMs) for Automatic Algorithm Design (AD). Please refer to the paper [LLM4AD] for detailed information, including the ...
In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed ...
Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results