Log In
New user? Click here to register. Have you forgotten your password?
NC State University Libraries Logo
    Communities & Collections
    Browse NC State Repository
Log In
New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Dr. Xiuli Chao, Committee Member"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Algorithms for Solving the Crosscutting Problem in a Wood Processing Mill
    (2006-08-07) Karimi, Sahar; Dr. Yahya Fathi, Committee Chair; Dr. Thom J. Hodgson, Committee Member; Dr. Xiuli Chao, Committee Member
    In this thesis, an exact and an inexact method are proposed for solving the crosscutting problem in a wood cutting mill. In a wood cutting mill, boards are first cut along their length (rip) into strips; then the obtained strips are cut along their width (crosscut) into cut-pieces with specific length and demand. Removing the defected areas of wood from the strips gives us clear pieces which must be cut into cut-pieces. The crosscutting problem is the problem of finding cutting patterns for all clear pieces such that demand of all cut-pieces is satisfied with minimum amount of incoming strips. A Mixed Integer Programming (MIP) model is developed for solving the crosscutting problem optimally; solving the MIP model is, however, very time-consuming. As a result, we added some valid inequalities (VI's) to the model with the purpose of increasing the efficiency of the model. The VI's are useful, but the model still couldn't solve large instances in reasonable time. To overcome the difficulty of solving time for large instances a heuristic method (inexact method) is proposed for solving the problem. We evaluated the quality of the solution obtained by the heuristic method, and its solving time. The heuristic method is fast enough to solve very large instances; the value of the solution obtained via this heuristic, however, is a few percent above optimal in the instances that we performed the experiment on.
  • No Thumbnail Available
    Solving Semi-Infinite Variational Inequalities
    (2006-08-02) Ozcam, Burcu; Dr. Xiuli Chao, Committee Member; Dr. Elmor L. Peterson, Committee Member; Dr. Shu-Cherng Fang, Committee Chair; Dr. Henry L.W. Nuttle, Committee Co-Chair
    The variational inequality problem arises in numerous contexts. In this dissertation, we consider solving a semi-infinite variational inequality problem, which is a variational inequality problem defined on a domain described by infinitely many constraints. We present characterization and the solution analysis for semi-infinite variational inequalities. After introducing the solution analysis, three solution methodologies, namely a discretizationbased smoothing method, an exchange method and an entropic analytic center cutting plane method are proposed. A comprehensive computational results with the comparison of the algorithms is provided.

Contact

D. H. Hill Jr. Library

2 Broughton Drive
Campus Box 7111
Raleigh, NC 27695-7111
(919) 515-3364

James B. Hunt Jr. Library

1070 Partners Way
Campus Box 7132
Raleigh, NC 27606-7132
(919) 515-7110

Libraries Administration

(919) 515-7188

NC State University Libraries

  • D. H. Hill Jr. Library
  • James B. Hunt Jr. Library
  • Design Library
  • Natural Resources Library
  • Veterinary Medicine Library
  • Accessibility at the Libraries
  • Accessibility at NC State University
  • Copyright
  • Jobs
  • Privacy Statement
  • Staff Confluence Login
  • Staff Drupal Login

Follow the Libraries

  • Facebook
  • Instagram
  • Twitter
  • Snapchat
  • LinkedIn
  • Vimeo
  • YouTube
  • YouTube Archive
  • Flickr
  • Libraries' news

ncsu libraries snapchat bitmoji

×