118,70 €
131,89 €
-10% with code: EXTRA
Combinatorial Optimization Problems in Geometric Settings
Combinatorial Optimization Problems in Geometric Settings
118,70
131,89 €
  • We will send in 10–14 business days.
Combinatorial Optimization Problems In Geometric Settings arise in several areas of Network Design such as positioning of cell phone towers or other sensors to provide coverage to the area of interest. These problems can typically be formulated as some version of geometric set cover such as clustering, facility. In a non-geometric setting all these problems would typically be hard to solve. The underlying geometry can at times be exploited, however, to find efficient approximate solutions.
  • Publisher:
  • Year: 2013
  • Pages: 124
  • ISBN-10: 3639700589
  • ISBN-13: 9783639700589
  • Format: 15.2 x 22.9 x 0.7 cm, softcover
  • Language: English
  • SAVE -10% with code: EXTRA

Combinatorial Optimization Problems in Geometric Settings (e-book) (used book) | bookbook.eu

Reviews

Description

Combinatorial Optimization Problems In Geometric Settings arise in several areas of Network Design such as positioning of cell phone towers or other sensors to provide coverage to the area of interest. These problems can typically be formulated as some version of geometric set cover such as clustering, facility. In a non-geometric setting all these problems would typically be hard to solve. The underlying geometry can at times be exploited, however, to find efficient approximate solutions.

EXTRA 10 % discount with code: EXTRA

118,70
131,89 €
We will send in 10–14 business days.

The promotion ends in 16d.19:35:41

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,32 Book Euros!?
  • Author: Gaurav Kanade
  • Publisher:
  • Year: 2013
  • Pages: 124
  • ISBN-10: 3639700589
  • ISBN-13: 9783639700589
  • Format: 15.2 x 22.9 x 0.7 cm, softcover
  • Language: English English

Combinatorial Optimization Problems In Geometric Settings arise in several areas of Network Design such as positioning of cell phone towers or other sensors to provide coverage to the area of interest. These problems can typically be formulated as some version of geometric set cover such as clustering, facility. In a non-geometric setting all these problems would typically be hard to solve. The underlying geometry can at times be exploited, however, to find efficient approximate solutions.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)