Sciweavers

1089 search results - page 24 / 218
» Bounds on generalized Frobenius numbers
Sort
View
MOC
2002
72views more  MOC 2002»
13 years 7 months ago
Long-term stability of variable stepsize approximations of semigroups
This paper is concerned with the stability of rational one-step approximations of C0 semigroups. Particular emphasis is laid on long-term stability bounds. The analysis is based on...
Nikolai Bakaev, Alexander Ostermann
COCOON
2001
Springer
14 years 3 days ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
MOR
2010
111views more  MOR 2010»
13 years 6 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
JGT
2010
158views more  JGT 2010»
13 years 6 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran
DISOPT
2010
132views more  DISOPT 2010»
13 years 7 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...