Now showing items 1-3 of 3

    • Canonical dual approach to solving 0-1 quadratic programming problems 

      Fang, S. C.; Gao, D. Y.; Sheu, R. L.; Wu, S. Y. (American Institute of Mathematical Sciences, 2008-02)
      This paper presents a canonical duality theory for solving nonconvex polynomial programming problems subjected to box constraints. It is proved that under certain conditions, the constrained nonconvex problems can be ...
    • Optimized rostering of workforce subject to cyclic requirements 

      Ramond, Francois (Virginia Tech, 2003-10-14)
      SNCF is a large-sized railway transportation company that needs to be operated 365 days a year and 24 hours a day. In order to schedule a certain category of workers in train stations and selling points, rosters are designed ...
    • Optimized rostering of workforce subject to cyclic requirements 

      Ramond, Francois (Virginia Tech, 2003-10-14)
      SNCF is a large-sized railway transportation company that needs to be operated 365 days a year and 24 hours a day. In order to schedule a certain category of workers in train stations and selling points, rosters are designed ...