14165 search results - page 318 / 2833 » The generalized two-server problem |
199
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
187
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
140
Voted
CPM
2004
Springer
16 years 2 days ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
188
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
183
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...