combinatoric complexity

Minimum-Peak-Cost Flows Over Time

  • Mariia Anapolska
  • Christina Büsing
  • Felix Engelhardt
  • Timo Gersing
  • Sabrina Schmitz
  • Sophia Wrede
    • Categories Combinatorial Optimization, Network Optimization Tags , , , ,

    \(\) Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimising peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC-MTRF problem. First, we discuss the limitations that emerge when restricting the solution space to … Read more

    Constraints reduction programming by subset selection: a study from numerical aspect

  • Yuan Shen
    • Categories 0-1 Programming, Applications - OR and Management Sciences, Convex Optimization Tags , , , , , ,

    We consider a novel method entitled constraints reduction programming which aims to reduce the constraints in an optimization model. This method is derived from various applications of management or decision making, and has potential ability to handle a wider range of applications. Due to the high combinatorial complexity of underlying model, it is difficult to … Read more