38 citations · 75 across the 14 of their papers we have counts for
15 papers
Outer approximations of core points for integer programming
Naghmeh Shahverdi, Seyyedmahsa Banihashemi, David Bremner
For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for s…
Sparktope: linear programs from algorithms
David Avis, David Bremner
In a recent paper Avis, Bremner, Tiwary and Watanabe gave a method for constructing linear programs (LPs) based on algorithms written in a simple programming language called Sparks…
Approximate Data Depth Revisited
Rasoul Shahsavarifar, David Bremner
Halfspace depth and -skeleton depth are two types of depth functions in nonparametric data analysis. The halfspace depth of a query point with respect to $S\…
Computing the Planar -skeleton Depth
Rasoul Shahsavarifar, David Bremner
For , the \emph{-skeleton depth} ($\SkD_β$) of a query point with respect to a distribution function on is defined as the probabi…
An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane
David Bremner, Rasoul Shahsavarifar
For a distribution function on and a point , the \emph{spherical depth} $\SphD(q;F)$ is defined to be the probability that a point is cont…
Polynomial size linear programs for problems in P
David Avis, David Bremner, Hans Raj Tiwary +1
A perfect matching in an undirected graph is a set of vertex disjoint edges from that include all vertices in . The perfect matching problem is to decide if ha…