Sciweavers

4 search results - page 1 / 1
» Weak k-majorization and polyhedra
Sort
View
EJC
2010
15 years 4 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
MP
1998
68views more  MP 1998»
15 years 3 months ago
Weak k-majorization and polyhedra
Geir Dahl, François Margot
JOTA
2010
104views more  JOTA 2010»
14 years 11 months ago
Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
X. Q. Yang, N. D. Yen
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 3 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd