Joachim Hyam Rubinstein

Joachim Hyam Rubinstein

Int. Trans. Oper. Res., 2022

Solving the prize-collecting Euclidean Steiner tree problem.

[BibT_eX]

[DOI]

David Whittle

Int. Trans. Oper. Res., 2022

Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes.

[BibT_eX]

[DOI]

Joachim Hyam Rubinstein

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2020

Optimum ramp design in open pit mines.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2020

Scheduling the construction of value and discount weighted trees for maximum net present value.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2020

2018

Minimal curvature-constrained networks.

[BibT_eX]

[DOI]

David Kirszenblat

J. Glob. Optim., 2018

Combined optimisation of an open-pit mine outline and the transition depth to underground mining.

[BibT_eX]

[DOI]

David Whittle

Eur. J. Oper. Res., 2018

2016

Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Gradient-constrained discounted Steiner trees I: optimal tree configurations.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

2015

Maximizing the net present value of a Steiner tree.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

Optimal curvature and gradient-constrained directional cost paths in 3-space.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

2014

Improving Underground Mine Access Layouts Using Software Tools.

[BibT_eX]

[DOI]

Interfaces, 2014

Bounding Embeddings of VC Classes into Maximum Classes.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

2012

Gradient-Constrained Minimum Networks. III. Fixed Topology.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2012

A Geometric Approach to Sample Compression.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2012

Curvature-constrained directional-cost paths in the plane.

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

2011

Optimal curvature-constrained paths with anisotropic costs in the plane.

[BibT_eX]

[DOI]

Proceedings of the 2011 Australian Control Conference, 2011

Extendibility and path components of admissible paths for the Dubins problem.

[BibT_eX]

[DOI]

Proceedings of the 2011 Australian Control Conference, 2011

2010

Corrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59].

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

2009

Shifting: One-inclusion mistake bounds and sample compression.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

2008

Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Constrained Path Optimisation for Underground Mine Layout.

[BibT_eX]

Proceedings of the World Congress on Engineering, 2007

2006

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.

[BibT_eX]

[DOI]

Nicholas C. Wormald

J. Glob. Optim., 2006

Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

2005

Visualizing Ricci Flow of Manifolds of Revolution.

[BibT_eX]

[DOI]

Robert Sinclair

Exp. Math., 2005

2001

A polynomial algorithm for a constrained traveling salesman problem.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Networks, 2001

Gradient-constrained minimum networks. I. Fundamentals.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

2000

A note on the compression theorem for convex surfaces.

[BibT_eX]

[DOI]

Discret. Math., 2000

1997

Steiner Trees for Terminals Constrained to Curves.

[BibT_eX]

[DOI]

Nicholas C. Wormald

SIAM J. Discret. Math., 1997

Full Minimal Steiner Trees on Lattice Sets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1997

Compression Theorems and Steiner Ratios on Spheres.

[BibT_eX]

[DOI]

J. Comb. Optim., 1997

Geodesic Surfaces in Knot Complements.

[BibT_eX]

[DOI]

Iain R. Aitchison

Exp. Math., 1997

Shortest networks on spheres.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

Minimal Steiner Trees for 2<sup>k</sup>×2<sup>k</sup> Square Lattices.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1996

1993

The Steiner Minimal Network for Convex Configurations.

[BibT_eX]

[DOI]

T. Cole

Discret. Comput. Geom., 1993

1992

Degree-five Steiner points cannot reduce network costs for planar sets.

[BibT_eX]

[DOI]

Networks, 1992

The Steiner Ration Conjecture for Cocircular Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

Graham's Problem on Shortest Networks for Points on a Circle.

[BibT_eX]

[DOI]

Algorithmica, 1992

1991

The Steiner ratio conjecture for six points.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1991

A variational approach to the Steiner network problem.

[BibT_eX]

[DOI]