Sciweavers

125 search results - page 7 / 25
» ams 2000
Sort
View
IFIP
2007
Springer
15 years 4 months ago
Elliptic Control by Penalty Techniques with Control Reduction
The paper deals with the numerical treatment of optimal control problems with bounded distributed controls and elliptic state equations by a wider class of barrier-penalty methods...
Christian Grossmann, Holger Kunz, Robert Meischner
APPML
2007
57views more  APPML 2007»
14 years 10 months ago
On plane bipartite graphs without fixed edges
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
Khaled Salem, Sandi Klavzar
DM
2010
117views more  DM 2010»
14 years 10 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar
DM
2010
108views more  DM 2010»
14 years 10 months ago
Locally toroidal polytopes and modular linear groups
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d 2, one obtains a finite group Gd often the automorphi...
Barry Monson, Egon Schulte
JGO
2008
98views more  JGO 2008»
14 years 10 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka