This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
The success of GIS has in some ways proved to be a mixed blessing to academic geography. While quantitative geography has developed as a disciplinary specialism over a long period ...
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...