Sciweavers

2738 search results - page 79 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
COMGEO
2010
ACM
13 years 10 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
POPL
2010
ACM
14 years 7 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
14 years 2 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
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...
Yves Pochet
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
EOR
2007
93views more  EOR 2007»
13 years 10 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...