fixed charge transportation problem

Facets of the knapsack polytope from non-minimal covers

  • Guneshwar Anand
  • Sachin Jayaswal
  • B. Srirangacharyulu
    • Categories (Mixed) Integer Linear Programming, Polyhedra, Transportation Tags , , , , ,

    We propose two new classes of valid inequalities (VIs) for the binary knapsack polytope, based on non-minimal covers. We also show that these VIs can be obtained through neither sequential nor simultaneous lifting of well-known cover inequalities. We further provide conditions under which they are facet-defining. The usefulness of these VIs is demonstrated using computational … Read more

    The Stochastic Multistage Fixed Charge Transportation Problem: Worst-Case Analysis of the Rolling Horizon Approach

  • Luca Bertazzi
  • Francesca Maggioni
    • Categories Stochastic Programming, Supply Chain Management Tags , , ,

    We introduce the Stochastic multistage fixed charge transportation problem in which a producer has to ship an uncertain load to a customer within a deadline. At each time period, a fixed transportation price can be paid to buy a transportation capacity. If the transportation capacity is used, the supplier also pays an uncertain unit transportation … Read more