Discrete Geometry and Optimization - Fields Institute Communications
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319001999, 9783319002002

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Further Generalization of the Colourful Carathéodory Theorem

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_11 ◽

2013 ◽

pp. 179-190 ◽

Cited By ~ 4

Author(s):

Frédéric Meunier ◽

Antoine Deza

Keyword(s):

Colourful Carathéodory Theorem ◽

Carathéodory Theorem

Download Full-text

Engineering Branch-and-Cut Algorithms for the Equicut Problem

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_2 ◽

2013 ◽

pp. 17-32 ◽

Cited By ~ 2

Author(s):

Miguel F. Anjos ◽

Frauke Liers ◽

Gregor Pardella ◽

Andreas Schmutzer

Keyword(s):

Branch And Cut

Download Full-text

Exploiting Symmetries in Polyhedral Computations

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_15 ◽

2013 ◽

pp. 265-278 ◽

Cited By ~ 1

Author(s):

Achill Schürmann

Download Full-text

On Minimal Tilings with Convex Cells Each Containing a Unit Ball

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_4 ◽

2013 ◽

pp. 45-54

Author(s):

Károly Bezdek

Keyword(s):

Unit Ball

Download Full-text

Discrete Geometry in Minkowski Spaces

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_1 ◽

2013 ◽

pp. 1-15

Author(s):

Javier Alonso ◽

Horst Martini ◽

Margarita Spirova

Keyword(s):

Discrete Geometry ◽

Minkowski Spaces

Download Full-text

Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_7 ◽

2013 ◽

pp. 105-120 ◽

Cited By ~ 3

Author(s):

Marianna E.-Nagy ◽

Monique Laurent ◽

Antonios Varvitsiotis

Keyword(s):

Matrix Completion ◽

Positive Semidefinite ◽

Positive Semidefinite Matrix ◽

Completion Problem ◽

Rank Constraint ◽

Matrix Completion Problem ◽

Semidefinite Matrix Completion ◽

Semidefinite Matrix

Download Full-text

Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_9 ◽

2013 ◽

pp. 133-162 ◽

Cited By ~ 7

Author(s):

Kaifeng Jiang ◽

Defeng Sun ◽

Kim-Chuan Toh

Keyword(s):

Least Squares ◽

Equality Constraints ◽

Nuclear Norm ◽

Least Squares Problems ◽

Linear Equality Constraints ◽

Linear Equality ◽

Semidefinite Matrix

Download Full-text

The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Number Twelve

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_8 ◽

2013 ◽

pp. 121-132 ◽

Cited By ~ 4

Author(s):

Thomas C. Hales

Keyword(s):

Sphere Packings ◽

Kissing Number

Download Full-text

On Volumes of Permutation Polytopes

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_5 ◽

2013 ◽

pp. 55-77 ◽

Cited By ~ 2

Author(s):

Katherine Burggraf ◽

Jesús De Loera ◽

Mohamed Omar

Download Full-text

A Primal–Dual Smooth Perceptron–von Neumann Algorithm

Discrete Geometry and Optimization - Fields Institute Communications ◽

10.1007/978-3-319-00200-2_17 ◽

2013 ◽

pp. 303-320 ◽

Cited By ~ 3

Author(s):

Negar Soheili ◽

Javier Peña

Keyword(s):

Von Neumann ◽

Primal Dual ◽

Von Neumann Algorithm

Download Full-text

Discrete Geometry and Optimization - Fields Institute CommunicationsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Further Generalization of the Colourful Carathéodory Theorem

Engineering Branch-and-Cut Algorithms for the Equicut Problem

Exploiting Symmetries in Polyhedral Computations

On Minimal Tilings with Convex Cells Each Containing a Unit Ball

Discrete Geometry in Minkowski Spaces

Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint

Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints

The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Number Twelve

On Volumes of Permutation Polytopes

A Primal–Dual Smooth Perceptron–von Neumann Algorithm

Discrete Geometry and Optimization - Fields Institute Communications
Latest Publications