Logistics Models

Several variations of logistics models (from ISE 754 at NCSU) are given in this repository. Each folder contains the model as well as some randomly generated test data. The following models are covered (click to find out more about each):

• Discreet Location Models - facility locating models
  • (CFLP) Capacitated Fixed-Charge Location Problem
  • (MCLP) Maximum Covering Location Problem
  • (SCLP) Set-Covering Location Models
  • (UFLP) Uncapacitated Fixed-Charge Location Problem
  • (NDP) Node Design Problem
  • (pCP) p-Center Problem
  • (pMP) p-Median Problem
• Distribution Models - minimize looping routes
  • (TSP) Traveling Salesman Problem
  • (VRP) Vehicle Routing Problem
• Network Models - minimize distances from one point to another
  • (NTP) Network Transportation Problem
  • (SPP) Shortest Path Problem

Notes

• The .ipynb files render differently in GitHub. This may result in latex formulas looking slightly off.
• Note that GitHub does not support README.ipynb files at the moment. For them to render more properly, navigate to the file.