Vladimir Ejov – författare

Visar alla böcker från författaren Vladimir Ejov. Handla med fri frakt och snabb leverans.

5 produkter

1. 

   Hamiltonian Cycle Problem and Markov Chains

   Av Vivek S. Borkar, Vladimir Ejov m. fl.

   Inbunden, 2012

   1098 kr

   Lägg i varukorg

   This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent …

2. 

   Hamiltonian Cycle Problem and Markov Chains

   Av Giang T. Nguyen, Jerzy A. Filar m. fl.

   E-bok, 2012

   1459 kr

   Lägg i varukorg

   This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent …

3. 

   Hamiltonian Cycle Problem and Markov Chains

   Av Vivek S. Borkar, Vladimir Ejov m. fl.

   Häftad, 2014

   1098 kr

   Lägg i varukorg

   This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent …

4. 

   Genetic Theory for Cubic Graphs

   Av Pouya Baniasadi, Vladimir Ejov m. fl.

   Häftad, 2015

   551 kr

   Lägg i varukorg

   This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The …

5. 

   Genetic Theory for Cubic Graphs

   Av Michael Haythorpe, Jerzy A. Filar m. fl.

   E-bok, 2015

   734 kr

   Lägg i varukorg

   This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The …