All Stories

  1. Deriving convex hulls through lifting and projection
  2. On the polyhedral structure of two-level lot-sizing problems with supplier selection
  3. A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem
  4. Multi-commodity variable upper bound flow models
  5. 10.1007/s11590-012-0540-2
  6. A class of algorithms for mixed-integer bilevel min–max optimization
  7. Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets
  8. Mitigating shortage and distribution costs in damaged water networks
  9. A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
  10. Explicit convex and concave envelopes through polyhedral subdivisions
  11. Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study
  12. A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
  13. A polyhedral study on 0–1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting
  14. A polyhedral study on
  15. Convexification Techniques for Linear Complementarity Constraints
  16. Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
  17. Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
  18. The Group-Theoretic Approach in Mixed Integer Programming
  19. Relations between facets of low- and high-dimensional group problems
  20. Vulnerability Assessment of Health Care Facilities during Disaster Events
  21. Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
  22. Cook, Kannan and Schrijver’s example revisited
  23. On the extreme inequalities of infinite group problems
  24. A time–space scheduling model for optimizing recurring bulk railcar deliveries
  25. Lifting inequalities: a framework for generating strong cuts for nonlinear programs
  26. An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad
  27. Facets of Two-Dimensional Infinite Group Problems
  28. New inequalities for finite and infinite group problems from approximate lifting
  29. Valid inequalities for MIPs and group polyhedra from approximate liftings
  30. Allocating security resources to a water supply network
  31. Warranty-based method for establishing reliability improvement targets
  32. Minimizing the Consequences of Intentional Attack on Water Infrastructure
  33. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting
  34. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms