|
|
|
|
|
Patcharin Buayen and Jeeraporn Werapun
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ...
ver más
|
|
|
|
|
|
|
|
|
Bao Tong, Jianwei Wang, Xue Wang, Feihao Zhou, Xinhua Mao and Wenlong Zheng
The optimal delivery route problem for truck?drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at r...
ver más
|
|
|
|
|
|
|
|
|
David Schaller, Manuela Geiß, Marc Hellmuth and Peter F. Stadler
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees....
ver más
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various...
ver más
|
|
|
|
|
|
|
|
|
András Faragó
A classic and fundamental result, known as the Lovász Local Lemma, is a gem in the probabilistic method of combinatorics. At a high level, its core message can be described by the claim that weakly dependent events behave similarly to independent ones. A...
ver más
|
|
|
|