Marcus Brazil

J. Glob. Optim., November, 2024

An exact algorithm for the Euclidean k-Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Geom., 2024

2023

Network augmentation for disaster-resilience against geographically correlated failure.

[BibT_eX]

[DOI]

Networks, June, 2023

Structural Properties of Minimum Multi-source Multi-Sink Steiner Networks in the Euclidean Plane.

[BibT_eX]

[DOI]

Alexander Westcott

J. Optim. Theory Appl., June, 2023

2022

Simplifying obstacles for Steiner network problems in the plane.

[BibT_eX]

[DOI]

Networks, 2022

An exact algorithm for constructing minimum Euclidean skeletons of polygons.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Minimum Steiner trees on a set of concyclic points and their center.

[BibT_eX]

[DOI]

David Whittle

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

2021

Computational complexity of the 2-connected Steiner network problem in the ℓp plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

A Physarum-Inspired Algorithm for Minimum-Cost Relay Node Placement in Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 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

2019

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2019

Computing minimum 2-edge-connected Steiner networks in the Euclidean plane.

[BibT_eX]

[DOI]

Networks, 2019

The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁p plane.

[BibT_eX]

[DOI]

CoRR, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.

[BibT_eX]

[DOI]

Comput. Geom., 2019

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

Stability and active power sharing in droop controlled inverter interfaced microgrids: Effect of clock mismatches.

[BibT_eX]

[DOI]

Ramachandra Rao Kolluri

Autom., 2018

2017

Siting and sizing distributed storage for microgrid applications.

[BibT_eX]

[DOI]

Ramachandra Rao Kolluri

Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017

2016

A Market Mechanism for Electric Vehicle Charging Under Network Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Smart Grid, 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

An exact algorithm for the bottleneck 2-connected k-Steiner network problem in Lp planes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Exploring Human: eBike Interaction to Support Rider Autonomy.

[BibT_eX]

[DOI]

Florian 'Floyd' Mueller

Proceedings of the 2016 Annual Symposium on Computer-Human Interaction in Play, 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

Generalised k-Steiner Tree Problems in Normed Planes.

[BibT_eX]

[DOI]

Algorithmica, 2015

A Multi-Factor Battery Cycle Life Prediction Methodology for Optimal Battery Management.

[BibT_eX]

[DOI]

Shivkumar Kalyanaraman

Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

Modelling voltage-demand relationship on power distribution grid for distributed demand management.

[BibT_eX]

[DOI]

Proceedings of the 2015 5th Australian Control Conference (AUCC), Gold Coast, 2015

2014

A flow-dependent quadratic steiner tree problem in the Euclidean plane.

[BibT_eX]

[DOI]

Marcus N. Brazil

Networks, 2014

Improving Underground Mine Access Layouts Using Software Tools.

[BibT_eX]

[DOI]

Interfaces, 2014

The Uniform Orientation Steiner Tree Problem is NP-Hard.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

A geometric characterisation of the quadratic min-power centre.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

On making energy demand and network constraints compatible in the last mile of the power grid.

[BibT_eX]

[DOI]

Ramachandra Rao Kolluri

Annu. Rev. Control., 2014

A distributed electric vehicle charging management algorithm using only local measurements.

[BibT_eX]

[DOI]

Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2014

2013

The Gilbert arborescence problem.

[BibT_eX]

[DOI]

Networks, 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

Relay augmentation for lifetime extension of wireless sensor networks.

[BibT_eX]

[DOI]

IET Wirel. Sens. Syst., 2013

2012

Gradient-Constrained Minimum Networks. III. Fixed Topology.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2012

Curvature-constrained directional-cost paths in the plane.

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

The bottleneck 2-connected k-Steiner network problem for k≤2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Minimum Opaque Covers for Polygonal Regions

[BibT_eX]

[DOI]

CoRR, 2012

2011

Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem

[BibT_eX]

[DOI]

CoRR, 2011

The bottleneck 2-connected $k$-Steiner network problem for $k\leq 2$

[BibT_eX]

[DOI]

CoRR, 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

Approximating minimum Steiner point trees in Minkowski planes.

[BibT_eX]

[DOI]

Networks, 2010

2009

A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees.

[BibT_eX]

[DOI]

Christian Wulff-Nilsen

Networks, 2009

Steiner trees for fixed orientation metrics.

[BibT_eX]

[DOI]

J. Glob. Optim., 2009

Translational packing of arbitrary polytopes.

[BibT_eX]

[DOI]

Jens Egeblad

Benny K. Nielsen

Comput. Geom., 2009

2008

Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points.

[BibT_eX]

[DOI]

J. Glob. Optim., 2008

Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space.

[BibT_eX]

[DOI]

James MacGregor Smith

Fundam. Informaticae, 2008

Bayesian node localisation in wireless sensor networks.

[BibT_eX]

[DOI]

Mark R. Morelande

William Moran

Proceedings of the IEEE International Conference on Acoustics, 2008

2007

Network optimization for the design of underground mines.

[BibT_eX]

[DOI]

Networks, 2007

Network modelling of underground mine layout: two case studies.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2007

Distributed Self-Localisation in Sensor Networks using RIPS Measurements.

[BibT_eX]

Proceedings of the World Congress on Engineering, 2007

Constrained Path Optimisation for Underground Mine Layout.

[BibT_eX]

Proceedings of the World Congress on Engineering, 2007

Hyperbolic Positioning Using RIPS Measurements for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Xuezhi Wang

William Moran

Proceedings of the 15th IEEE International Conference on Networks, 2007

2006

Locally minimal uniformly oriented shortest networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Flexibility of Steiner trees in uniform orientation metrics.

[BibT_eX]

[DOI]

Pawel Winter

Networks, 2005

2004

Rotationally optimal spanning and Steiner trees in uniform orientation metrics.

[BibT_eX]

[DOI]

Comput. Geom., 2004

2002

Forbidden subpaths for Steiner minimum networks in uniform orientation metrics.

[BibT_eX]

[DOI]

Networks, 2002

2001

Gradient-constrained minimum networks. I. Fundamentals.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

2000

Minimum Networks in Uniform Orientation Metrics.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

On the Complexity of the Steiner Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

1999

A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves.

[BibT_eX]

[DOI]

Networks, 1999

1997

Full Minimal Steiner Trees on Lattice Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Gradient-constrained minimal Steiner trees.

[BibT_eX]

[DOI]

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

Shortest networks on spheres.

[BibT_eX]

[DOI]

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

1996

Minimal Steiner Trees for 2k×2k Square Lattices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

1991

Monoid Growth Functions for Braid Groups.

[BibT_eX]

[DOI]