Sciweavers

PROCEDIA
2010
67views more  PROCEDIA 2010»
13 years 3 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov
GC
2002
Springer
13 years 4 months ago
The Chromatic Spectrum of Mixed Hypergraphs
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Vol...
JGO
2008
53views more  JGO 2008»
13 years 5 months ago
Smoothing by mollifiers. Part II: nonlinear optimization
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
Hubertus Th. Jongen, Oliver Stein