Miguel A. Lejeune

Integer Programming Solution Approach for Inventory-Production-Distribution Problems with Direct Shipments

  • Miguel A. Lejeune
  • François Margot
    • Categories Branch and Cut Algorithms, Cutting Plane Approaches, Supply Chain Management Tags , , ,

    We construct an integrated multi-period inventory-production-distribution replenishment plan for three-stage supply chains. The supply chain maintains close-relationships with a small group of suppliers, and the nature of the products (bulk, chemical, etc.) makes it more economical to rely upon a direct shipment, full-truck load distribution policy between supply chain nodes. In this paper, we formulate … Read more

    Cover Inequalities for Binary-Integer Knapsack Constraints

  • Miguel A. Lejeune
  • Andrzej Ruszczyński
    • Categories (Mixed) Integer Linear Programming, Integer Programming Tags , , , ,

    We consider knapsack constraints involving one general integer and many binary variables. We introduce the concept of a cover for such a constraint and we construct a new family of valid inequalities based on this concept. We generalize this idea to extended covers, and we propose a specialized lifting procedure for cover inequalities. Finally, we … Read more