Order Total (1 Item Items):
Shipping Destination:
Discrete Fractional Programming Techniques by Barros a I (21 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (21)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (6)
- Not Print on Demand (17)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Discrete and Fractional Programming Techniques for Location Models (Combinatorial Optimization, 3)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.82
Convert currencyFree shipping within United KingdomQuantity: Over 20 available
Add to basketCondition: New. In.
-
£ 50.21
Convert currency£ 11.97 shipping from Germany to United KingdomQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
£ 42.62
Convert currency£ 21.38 shipping from Germany to United KingdomQuantity: Over 20 available
Add to basketCondition: New.
-
Paperback. Condition: Brand New. reprint edition. 198 pages. 9.25x6.10x0.46 inches. In Stock.
-
£ 68.63
Convert currency£ 6.71 shipping from U.S.A. to United KingdomQuantity: 4 available
Add to basketCondition: New. pp. 200.
-
£ 73.58
Convert currency£ 7.61 shipping from Germany to United KingdomQuantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Seiten: 180 | Sprache: Englisch | Produktart: Bücher.
-
£ 75.33
Convert currency£ 13.04 shipping from U.S.A. to United KingdomQuantity: 1 available
Add to basketHardcover. Condition: Fine.
-
Paperback. Condition: Like New. Like New. book.
-
Condition: New. pp. 200 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
£ 45.42
Convert currency£ 55.90 shipping from U.S.A. to United KingdomQuantity: Over 20 available
Add to basketCondition: New.
-
£ 97.06
Convert currency£ 6.71 shipping from U.S.A. to United KingdomQuantity: 1 available
Add to basketCondition: New. pp. 200.
-
Discrete and Fractional Programming Techniques for Location Models (Combinatorial Optimization, 3)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 108.02
Convert currencyFree shipping within United KingdomQuantity: Over 20 available
Add to basketCondition: New. In.
-
£ 105.35
Convert currency£ 6.80 shipping from Germany to United KingdomQuantity: 1 available
Add to basketCondition: New. pp. 200.
-
£ 113.28
Convert currency£ 21.38 shipping from Germany to United KingdomQuantity: Over 20 available
Add to basketGebunden. Condition: New.
-
£ 97.33
Convert currency£ 55.90 shipping from U.S.A. to United KingdomQuantity: Over 20 available
Add to basketCondition: New.
-
Hardcover. Condition: Like New. Like New. book.
-
Discrete and Fractional Programming Techniques for Location Models
Published by Springer Us Apr 1998, 1998
ISBN 10: 0792350022 ISBN 13: 9780792350026
Language: English
£ 156.05
Convert currency£ 11.97 shipping from Germany to United KingdomQuantity: 2 available
Add to basketBuch. Condition: Neu. Neuware - 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.
-
Discrete and Fractional Programming Techniques for Location Models
Published by Springer US Nov 2013, 2013
ISBN 10: 1461368243 ISBN 13: 9781461368243
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
£ 47.13
Convert currency£ 9.41 shipping from Germany to United KingdomQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 200 pp. Englisch.
-
Condition: New. Print on Demand pp. 200 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Discrete and Fractional Programming Techniques for Location Models
Published by Springer US, Springer New York Nov 2013, 2013
ISBN 10: 1461368243 ISBN 13: 9781461368243
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
£ 47.13
Convert currency£ 29.94 shipping from Germany to United KingdomQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 200 pp. Englisch.
-
£ 74.50
Convert currency£ 6.80 shipping from Germany to United KingdomQuantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 200.
