Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada Discrete and Fractional Programming Techniques for Location Models
Type
Physical Book
Publisher
Language
English
Pages
180
Format
Paperback
Dimensions
23.4x15.6x1.1 cm
Weight
0.29 kg.
ISBN13
9781461368243

Discrete and Fractional Programming Techniques for Location Models

A. I. Barros (Author) · Springer · Paperback

Discrete and Fractional Programming Techniques for Location Models - Barros, A. I.

Cheaper New Book Imported to Netherlands
Delivery: 25 Sep - 02 Oct Shipping: 13 to 17 business days.
€ 53,70
Faster New Book Imported to Netherlands
Delivery: 16 Sep - 18 Sep Shipping: 6 to 7 business days.
€ 69,15
Import costs and 9% BTW included in the price ✅
€ 53,70

Synopsis "Discrete and Fractional Programming Techniques for Location Models"

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews