Virginia Tech
    • Log in
    View Item 
    •   VTechWorks Home
    • ETDs: Virginia Tech Electronic Theses and Dissertations
    • Masters Theses
    • View Item
    •   VTechWorks Home
    • ETDs: Virginia Tech Electronic Theses and Dissertations
    • Masters Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A Squared-Euclidean distance location-allocation problem

    Thumbnail
    View/Open
    LD5655.V855_1990.T874.pdf (3.725Mb)
    Downloads: 115
    Date
    1990-05-04
    Author
    Tuncbilek, Cihan H.
    Metadata
    Show full item record
    Abstract
    none available
     
    This thesis is concerned with the analysis of a squared-Euclidean distance location-allocation problem with balanced transportation constraints, where the costs are directly proportional to distances and the amount shipped. The problem is shown to be equivalent to maximizing a convex, quadratic function subject to transportation constraints. A branch and bound algorithm is developed that utilizes a specialized, tight, linear programming representation to compute strong upper bounds. These bounds are shown to substantially dominate several other upper bounds that are derived using standard techniques, to an extent which significantly increases the size of problems solvable within a reasonable effort. The special structure of the transportation constraints is used to derive a partitioning scheme, and this structure is further exploited via suitable logical tests which tighten the bounds implied on the transportation flows by the branching restrictions. The transportation structure is also used to generate additional cut-set inequalities based on a cycle prevention method which preserves a forest graph for any partial solution. Results of the computational experiments, and a discussion of possible extensions are also presented.
     
    URI
    http://hdl.handle.net/10919/42358
    Collections
    • Masters Theses [19414]

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us
     

     

    VTechWorks

    AboutPoliciesHelp

    Browse

    All of VTechWorksCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Log inRegister

    Statistics

    View Usage Statistics

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us