Sciweavers

1650 search results - page 40 / 330
» The HOM problem is decidable
Sort
View
DAM
2006
81views more  DAM 2006»
13 years 7 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
TRANSCI
2002
106views more  TRANSCI 2002»
13 years 7 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
14 years 2 months ago
The Economic Production Quantity Problem with a Finite Production Rate and Fuzzy Cycle Time
Managing the inventories along with carrying out the production program is essential for many companies in the producing industry. In this paper, a fuzzy EPQ (Economic Production ...
Kaj-Mikael Björk
COCOON
2005
Springer
14 years 1 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
FORMATS
2005
Springer
14 years 1 months ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini