NOVA. The University of Newcastle's Digital Repository

NOVA. The University of Newcastle's Digital Repository

  • Home
  • Contribute
Home -List Of Titles
List View List View   Icon View Icon View

Showing items 1 - 3 of 3.

Add to Quick Collection   All 3 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort By Title:  Ascending | Descending
Image Thumbnail

Add Improved preprocessing labeling and scaling algorithms for the weight-constrained shortest path problem

Image Thumbnail

Add A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Image Thumbnail

Add Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

  • First
  • Previous
  • 1
  • Next
  • Last
Author/Creator
  • Boland, Natashia (2)
  • Dumitrescu, I. (1)
  • Mak, Vicky (1)
  • Mateus, Geraldo Robson (1)
  • Ravetti, Martín Gómez (1)
  • de Paula, Mateus Rocha (1)
Keyword
  • approximation algorithms (1)
  • branch-and-bound method (1)
  • combinatorial optimisation (1)
  • constrained shortest paths (1)
  • labeling algorithms (1)
  • parallel machines (1)
  • polyhedral analysis (1)
  • relax-and-cut (1)
  • scheduling problems (1)

Repository

  • Show All  
  • Show Quick Collection 
Advanced Search

Search

Browse

  • By Title 
  • By Author/Creator 
  • By Keyword 
  • By Date 
  • By Resource Type 

Highlights

  • Most Accessed Items 
  • Most Accessed Authors 
  • Latest Additions 

Work of The Day

Modelling of the formation of Pd-Ni alloy nanoparticles by interdiffusion

Evteev, A. V. 2008

Resources

  • About 
  • Help 
  • Copyright 
Valid XHTML 1.0 Strict Powered by VITAL Repository Staff Sign In | Disclaimer | Privacy | Take Down Notice | Contact Us | Back To Top

Copyright © 2007 | The University of Newcastle, Australia | CRICOS Provider Number 00109J