FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Discrete and Fractional Programming Techniques for Location Models

Discrete and Fractional Programming Techniques for Location Models

A.I. Barros
    Product form
      FORMAT: Hardback

      R 3,290.26 Price and availability exclusive to website

      YOU COULD EARN 3,290.26 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 548.37 per month!
      3x monthly payments of R 1,096.75 with
      4x fortnightly payments of R 822.56 with
      At first sight discrete and fractional programming techniques appear to be two com­ pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con­ sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc. , while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis­ crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net­ work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models.
      Format: CONTRIBUTORS: A.I. Barros EAN: 9780792350026 COUNTRY: Netherlands PAGES: WEIGHT: 1010 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 1998-04-30 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Calculus, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Optimization, Algorithms and data structures, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      At first sight discrete and fractional programming techniques appear to be two com­ pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con­ sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc. , while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis­ crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net­ work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models.
      Format: CONTRIBUTORS: A.I. Barros EAN: 9780792350026 COUNTRY: Netherlands PAGES: WEIGHT: 1010 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 1998-04-30 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Calculus, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Optimization, Algorithms and data structures, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account