Natashia Boland

Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem

  • Natashia Boland
  • Ranga Muhandiramge
  • Song Wang
    • Categories Control Applications, Network Optimization, Semi-infinite Programming

    In many path planning situations we would like to find a path of constrained Euclidean length in 2D that minimises a line integral. We call this the Continuous Length-Constrained Minimum Cost Path Problem (C-LCMCPP). Generally, this will be a non-convex optimization problem, for which continuous approaches only ensure locally optimal solutions. However, network discretisations yield … Read more

    A strengthened formulation for the open pit mine production scheduling problem

  • Natashia Boland
  • Gary Froyland
  • Christopher Fricke
    • Categories Applications - Science and Engineering Tags , ,

    We present a strengthened integer programming formulation for the open pit mine production scheduling problem, where the precedence and production constraints are combined to form 0-1 knapsack inequalities. Addition of corresponding knapsack cover inequalities decreases the computational requirements to obtain the optimal integer solution, in many cases by a significant margin. CitationThe University of Melbourne, … Read more

    Clique-based facets for the precedence constrained knapsack problem

  • Andreas Bley
  • Natashia Boland
  • Gary Froyland
  • Renata Sotirov
  • Christopher Fricke
    • Categories 0-1 Programming, Polyhedra

    We consider a knapsack problem with precedence constraints imposed on pairs of items, known as the precedence constrained knapsack problem (PCKP). This problem has applications in management and machine scheduling, and also appears as a subproblem in decomposition techniques for network design and other related problems. We present a new approach for determining facets of … Read more