Seite 1 von 498 Ergebnissen

Sortieren nach: Relevanz | Aktualität | Titel

  1.  

    Convex hulls of spheres and convex hulls of disjoint convex polytopes

    Karavelas, Menelaos I. / Seidel, Raimund / Tzanaki, Eleni | Elsevier | 2013
    Schlagwörter: Combinatorial geometry, Convex hull, Disjoint convex polytopes
  2.  

    On a combinatorial sum

    Alzer, Horst | Elsevier | 2015
    Schlagwörter: Combinatorial sum, Convex
  3.  

    Polytopes with few vertices and few facets

    Padrol, Arnau | Elsevier | 2015
    Schlagwörter: Convex polytopes, Number of combinatorial types
  4.  

    The convex dimension of a graph

    Halman, Nir / Onn, Shmuel / Rothblum, Uriel G. | Elsevier | 2007
    Schlagwörter: Convex combinatorial optimization
  5.  

    Global Binary Optimization on Graphs for Classification of High Dimensional Data

    E. Merkurjev / E. Bae / A. L. Bertozzi et al. | NTIS | 2014
    Schlagwörter: Combinatorial optimization, Convex optimization
  6.  

    Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

    Khan, Arindam / Pal, Sudebkumar P. / Aanjaneya, Mridul et al. | Elsevier | 2012
    Schlagwörter: Convex-quadrilateralizable polygon, Combinatorial geometry
  7.  

    A combinatorial property on angular orders of plane point sets

    Fabila-Monroy, Ruy / Huemer, Clemens / Lara, Dolores | Elsevier | 2011
    Schlagwörter: Combinatorial problems, Convex angle
  8.  

    Reprint of: Weak &z.epsi;-nets have basis of size O ( 1 / &z.epsi; log ( 1 / &z.epsi; ) ) in any dimension

    Mustafa, Nabil H. / Ray, Saurabh | Elsevier | 2007
    Schlagwörter: Combinatorial geometry, Hitting convex sets
  9.  

    Weak &z.epsi;-nets have basis of size O ( 1 / &z.epsi; log ( 1 / &z.epsi; ) ) in any dimension

    Mustafa, Nabil H. / Ray, Saurabh | Elsevier | 2007
    Schlagwörter: Combinatorial geometry, Hitting convex sets
  10.  

    A REVIEW OF TREE CONVEX SETS TEST

    Sheng Bao, Forrest / Zhang, Yuanlin | Wiley | 2012
    Schlagwörter: Combinatorial Auction Problems, tree convex sets, row convex constraints
  11.  

    Convex Combinatorial Optimization

    Onn, Shmuel / Rothblum, Uriel G. | Springer Verlag | 2004
    Schlagwörter: Combinatorial Optimization, Convex Combinatorial, Combinatorial Optimization Problem
  12.  

    The cost of cutting out convex n-gons

    Dumitrescu, Adrian | Elsevier | 2003
    Schlagwörter: Combinatorial geometry, Convex polygons
  13.  

    SOME COMBINATORIAL GEOMETRY FOR CONVEX QUADRILATERALS

    Nationallizenz
    Francis, John | Springer Verlag | 2000
    Schlagwörter: Combinatorial Geometry, Convex Quadrilateral, Nonintersecting Convex
  14.  

    On the largest convex subsets in Minkowski sums

    Tiwary, Hans Raj | Elsevier | 2014
    Schlagwörter: Convex subsets, Combinatorial problems
  15.  

    Examples

    Grünbaum, Branko | Springer Verlag | 2003
    Schlagwörter: Convex Hull, Convex POLYTOPES, Combinatorial Type, Convex and Discrete Geometry
  16.  

    A combinatorial optimization approach for evaluating minimum-zone spatial straightness errors

    Endrias, Dawit H. / Feng, Hsi-Yung / Ma, Ji et al. | Elsevier | 2012
    Schlagwörter: Combinatorial optimization, Convex hull
  17.  

    A hierarchy of relaxations for nonlinear convex generalized disjunctive programming

    Ruiz, Juan P. / Grossmann, Ignacio E. | Elsevier | 2011
    Schlagwörter: Combinatorial optimization, Convex programming
  18.  

    On convex decompositions of a planar point set

    Hosono, Kiyoshi | Elsevier | 2008
    Schlagwörter: Convex hull of a point set, Combinatorial convexity
  19.  

    Fundamental Properties and Constructions

    Grünbaum, Branko | Springer Verlag | 2003
    Schlagwörter: Convex Hull, Convex POLYTOPES, Combinatorial Type, Convex and Discrete Geometry
  20.  

    Capacitated two-stage time minimization transportation problem with restricted flow

    Kaur, Prabhjot / Verma, Vanita / Dahiya, Kalpana | EDP Sciences | 2017
    Schlagwörter: Non-convex programming, combinatorial optimization

Ergebnisse anzeigen: 10 | 20 | 50