We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...