Now showing items 1-2 of 2

    • Cutting plane algorithms for 0-1 programming based on cardinality cuts 

      Oguz, O. (Elsevier, 2010)
      We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming ...
    • Provisioning virtual private networks under traffic uncertainty 

      Altın, A.; Amaldi, E.; Belotti, P.; Pınar, M. Ç. (John Wiley & Sons, 2007)
      We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic ...