« September 2010 »
Su Mo Tu We Th Fr Sa
1234
567891011
12131415161718
19202122232425
2627282930
 
   
Document Actions

Research Project: Exploring the Network Design Polytope

composed by Michael O'Sullivan, Cameron Walkercreated by Michael O'Sullivan last modified 2008-02-14 09:59

Back to Research Field: Step 3: Design the Network

  Exploring the effect of different formulations and techniques on the Network Design Polytope

Abstract: This research project involves exploring the effect of different formulations and techniques on the Network Design Polytope. By defining and/or "trimming" the polytope in "good" ways we hope to decrease the solution time for network design problems.

Keywords:
Storage Networks, Network Design, Integer Programming, Polytope

  Research Project Information
Runtime: Since 2008-02-13
Project coordination: NDSG
Scientific staff: Mike O'Sullivan; Cameron Walker

Publications

'A Mixed-Integer Approach to Storage Network Design using Generic Network Components', Michael O'Sullivan and Cameron Walker
School of Engineering Technical Report No. 626, Department of Engineering Science, University of Auckland, 2005.

One of the main ways to decrease integer programming solution times is to add mathematical structures to the formulation that eliminate non-integer solutions, i.e., define a better polytope. Another technique adds "good" cuts to remove non-integer solutions as they are encountered during the solution process, i.e., "trim" the polytope. This research project explores the effect of new approaches to network design on the network design polytope. By carefully considering the mathematical properties of these approaches we hope to both identify which approaches are effective in decreasing solution times and also uncover new approaches for "attacking" the network design polytope.





Project Structure