Discrete and Fractional Programming Techniques for Location Models

Name: Discrete and Fractional Programming Techniques for Location Models
Brand: Springer-Verlag New York Inc.
SKU: 9781461368243
Price: 19296 HUF
Availability: InStock

Szerző: A. I. Barros

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer-Verlag New York Inc.

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

19 296 Ft

At first sight discrete and fractional programming techniques appear to be two com pletely unrelated...

Információk a könyvről

Szerző

A. I. Barros

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2013

oldal

180

EAN

9781461368243

ISBN

1461368243

Enbook ID

02717020

Kiadó

Springer-Verlag New York Inc.

Súly

314

Méretek

155 x 235 x 12

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Discrete and Fractional Programming Techniques for Location Models

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták