0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Discrete and Fractional Programming Techniques for Location Models (Paperback, Softcover reprint of the original 1st ed. 1998) Loot Price: R1,494
Discovery Miles 14 940
Discrete and Fractional Programming Techniques for Location Models (Paperback, Softcover reprint of the original 1st ed. 1998):...

Discrete and Fractional Programming Techniques for Location Models (Paperback, Softcover reprint of the original 1st ed. 1998)

A. I. Barros

Series: Combinatorial Optimization, 3

 (sign in to rate)
Loot Price R1,494 Discovery Miles 14 940 | Repayment Terms: R140 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Combinatorial Optimization, 3
Release date: November 2013
First published: 1998
Authors: A. I. Barros
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 180
Edition: Softcover reprint of the original 1st ed. 1998
ISBN-13: 978-1-4613-6824-3
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Calculus of variations
Books > Science & Mathematics > Mathematics > Optimization > General
Promotions
LSN: 1-4613-6824-3
Barcode: 9781461368243

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,217 Discovery Miles 52 170
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,268 Discovery Miles 72 680
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R192 Discovery Miles 1 920
The Math Behind the Magic - Fascinating…
Ehrhard Behrends Paperback R988 Discovery Miles 9 880
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,018 Discovery Miles 30 180
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,120 Discovery Miles 11 200
Counting (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R775 Discovery Miles 7 750
Algebraic Number Theory and Fermat's…
Ian Stewart, David Tall Paperback R1,368 Discovery Miles 13 680
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,333 Discovery Miles 23 330
Combinatorial Functional Equations…
Yanpei Liu Hardcover R4,460 Discovery Miles 44 600
Algebraic Combinatorics
Eiichi Bannai, Etsuko Bannai, … Hardcover R4,263 Discovery Miles 42 630
Inverse Problems and Zero Forcing for…
Leslie Hogben, Jephian C.-H. Lin, … Paperback R3,199 Discovery Miles 31 990

See more

Partners