- Constrained Optimization 1.docx
- A generic approach for nesting 2d parts in 2d sheets
- ITDNW01
- 585-932-1-SM
- Mathematical Modeling for Business Analytics
- F1
- Algorithmic Aspects of Wireless Sensor Networks
- Mathematical Modeling, Analysis and Parameter Estimation on a Heat Conduction Experiment
- Rr210504 Design and Analysis of Algorithms
- production control
- A Simple and Efficient Algorithm for Solving Type-1 Intuitionistic Fuzzy Solid Transportation Problems
- Developing the World Wide Web Using Virtual
- (20-21)-search method.pdf
- Bubble and Dew Point Calculations in Multicomponent and Multireactive Mixtures
- an-innovative-technique-for-design-optimization-of-core-type-phase-distribution-transformer-using-mathematica-2229-8711-3-142.pdf
- 04 Unit Commitment
- ucfl
- Optimal Govnt Policy
- Chapter 10
- Review of Hooke and Jeeves method
- An Algorithmic Approach for Traveling Salesman Problem Using
- Load Balancing Approach in Heterogeneous Distributed Systems - A Review
- OptiStruct_01_Design Concept for a Structural C-Clip
- Montiel Dimitrakopoulos 2013
- Flyer for RUppalari
- Multiobjective Optimization
- Tutorial Scia Optimizer
- Introduction to Linear Optimization
- Design for Structural and Energy Performance of Long Span Buildings Using Geometric Multi Objective Optimization_2016
- Design and Control of Equalization Tanks
- Sapiens: A Brief History of Humankind
- Yes Please
- The Unwinding: An Inner History of the New America
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- Dispatches from Pluto: Lost and Found in the Mississippi Delta
- John Adams
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America
- The Prize: The Epic Quest for Oil, Money & Power
- This Changes Everything: Capitalism vs. The Climate
- Grand Pursuit: The Story of Economic Genius
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story
- The Emperor of All Maladies: A Biography of Cancer
- Team of Rivals: The Political Genius of Abraham Lincoln
- The New Confessions of an Economic Hit Man
- Rise of ISIS: A Threat We Can't Ignore
- The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers
- Smart People Should Build Things: How to Restore Our Culture of Achievement, Build a Path for Entrepreneurs, and Create New Jobs in America
- The World Is Flat 3.0: A Brief History of the Twenty-first Century
- Bad Feminist: Essays
- How To Win Friends and Influence People
- Steve Jobs
- Angela's Ashes: A Memoir
- The Silver Linings Playbook: A Novel
- Leaving Berlin: A Novel
- Extremely Loud and Incredibly Close: A Novel
- The Sympathizer: A Novel (Pulitzer Prize for Fiction)
- The Light Between Oceans: A Novel
- The Incarnations: A Novel
- You Too Can Have a Body Like Mine: A Novel
- Life of Pi
- The Love Affairs of Nathaniel P.: A Novel
- The Blazing World: A Novel
- The Rosie Project: A Novel
- The First Bad Man: A Novel
- We Are Not Ourselves: A Novel
- The Flamethrowers: A Novel
- Brooklyn: A Novel
- A Man Called Ove: A Novel
- The Master
- Bel Canto
- Interpreter of Maladies
- The Kitchen House: A Novel
- Beautiful Ruins: A Novel
- The Art of Racing in the Rain: A Novel
- Wolf Hall: A Novel
- The Wallcreeper
- A Prayer for Owen Meany: A Novel
- The Cider House Rules
- Lovers at the Chameleon Club, Paris 1932: A Novel
- The Bonfire of the Vanities: A Novel
- The Perks of Being a Wallflower
- The Constant Gardener: A Novel

**social networks with interaction between research
**

nodes”

Aleksandra Tomi´c

Faculty of of Science, Department of Mathematics and Computer Science

University in Novi Sad

Trg Dositeja Obradovi´ca 4

21000 Novi Sad, Serbia

tomaleks007@gmail.com

October 30, 2014

Abstract

In the recent paper Miˇskovi´c, S.: Problem of exploration of online social networks with interaction between research nodes. In: Proceedings of

the 11th Balkan Conference on Operations Research - BALCOR’2013, pp.

298–306 (2013), the author present an eﬃcient exploration of an online

social network. The goal is to minimize the amount of time searching for

deﬁned characteristics, while both connection parameters between user

and control nodes and interaction between control devices is taken under

consideration. A mathematical model is developed and solved by an iterated simulated annealing method (ISA). However, the author has made a

few mistakes that will be explained in detail in this paper.

Keywords: Location problems, Social networks, Combinatorial optimization.

1

Introduction

Online social networks are webs of relationships that grow from computermediated discussions. The webs grow from conversations among people who

share a common aﬃnity (e.g., they work for the same company, department,

or in the same discipline) and who diﬀer in other ways (e.g., they are in diﬀerent locations, keep diﬀerent hours, specialize in diﬀerent disciplines, work for

diﬀerent companies). When the people are distributed across time and space,

then these conversations need to take place online, over an intranet or private

internet forum. Online social networks are already at the heart of some very

popular Web sites. As the technology matures, more applications are likely

to emerge. It is also likely that social networking will play an important role

1

**in future personal and commercial online interaction, as well as the location
**

and organization of information and knowledge. Online social networks oﬀer

the opportunity to a user to create its own proﬁle and connect to other users

proﬁles on diﬀerent ways: via declaration, acceptance, friendship, appreciation

(like), depreciation (dislike), etc. A social networking service is an online service, platform, or site that focuses on facilitating the building of social networks

or social relations among people who, for example, share interests, activities,

backgrounds, or real-life connections. A social network service consists of a representation of each user (often a proﬁle), his/her social links, and a variety of

additional services. In the recent paper Miˇskovi´c, S.: Problem of exploration of

online social networks with interaction between research nodes. In: Proceedings

of the 11th Balkan Conference on Operations Research - BALCOR’2013, pp.

298–306 (2013), the author present an eﬃcient exploration of an online social

network and a mathematical model is developed and solved by an iterated simulated annealing method (ISA). However, the author has made a few mistakes

that will be explained in detail in the next section. This is not the unique case,

since the authors Stanimirovi´c and Miˇskovi´c already made many mistakes in

the paper [3] of what is written in the [2] and [5].

2

Problem definition

**In this section is presented integer quadratic programming deﬁnition of the
**

problem deﬁned in [1]:

∑∑

∑∑

min

eij · xij +

fjk · yjk

(1)

i∈M j∈N

j∈N k∈N

such that:

xij ≤ zj ,

∑

f or all i ∈ M,

xij = 1,

f or all j ∈ N

f or all i ∈ M

(2)

(3)

j∈N

∑

zj = p

(4)

j∈N

∑

xik + zj ≤ 1,

f or all i ∈ M,

f or all j ∈ N

(5)

k:eik >eij

yjk ≤ zj · zk ,

∑∑

f or all j, k ∈ N

yjk = p − 1

j∈N k∈N

2

(6)

(7)

∑ ∑

yjk ≤ |N ′ | − 1,

f or all N ′ ⊆ N, 1 ≤ |N ′ | ≤ p

(8)

j∈N ′ k∈N ′

xij , yjk , zj ∈ {0, 1} ,

3

f or all i ∈ M,

f or all j, k ∈ N

(9)

Main results

**Unfortunately, in the paper [1] indicates a high number of substantive errors.
**

On page 299. the problem is not properly deﬁned, as a text deﬁnition (”bullet”s on page 299 ) indicates that a problem would be bi-objective, but integer

quadratic formulation shown that the problem of a single objective.

On page 300. in Example 1 is misstated optimal solution value as equal to

253 with established resource nodes tree 1 − 3 − 5 − 6. The ﬁrst mistake is that

a given solution value is not supplied with the established resource nodes tree

1 − 3 − 5 − 6 but 6 − 1 − 3 − 5. Even greater mistake is that it is not the optimal

value! Correct optimal value is equal to 250 with established resource nodes

tree 6 − 1 − 3 − 2. User assignments are:

• Resource node 1: users 3, 4, 7 and 10;

• Resource node 2: users 1, 14 and 16;

• Resource node 3: users 12, 13 and 15;

• Resource node 6: users 2, 5, 6, 8, 9 and 11.

Since neither the total enumeration technique and the iterated simulated annealing were unable to calculate the optimal small instance in Example 1, probably all presented optimal solutions and the computational results are wrong!

It is also very problematic that the iterated simulated annealing is capable to

reach optimal solutions, since it failed even to very small instances in Example

1.

On page 300. constraints (5) are completely unnecessary! Minimization of

objective function and non-negative exploration costs eij between established

resources but ensure that each user node is assigned to the established resource

node with minimal assignment costs between them.

On page 300. Integer quadratic formulation can be very easily linearized,

since it is quite evident that the conditions (6) are trivially become linear:

yjk ≤ 0.5 · zj + 0.5 · zk

f or all j, k ∈ N

(10)

**On page 303, Conclusions section. Sentence ”Since instances with more
**

than 100 user nodes could not be solved to optimality by exact algorithm in a

reasonable execution time...” If in the largest instances l40 instead of p = 100

replace, for example, p = 3 so altered instance complete enumeration routinely

will solved in the achievable execution time, since the complexity is equal O(m ·

3

(n)

( )

9

) = O(2500 · 220

3 ) ≈ O(4.3 · 10 ), which suﬃciently shows that the previous

sentence of section Conclusions is wrong.

Consider again the largest instance l40 and truncate matrix E to ﬁrst m = 5

rows. Although m = 5 is much less than 100 user nodes, this instance certainly

will not be solved optimally

execution time since the

( ) in all your

( achievable

)

65

)

>

O(10

).

complexity is equal O(m · np ) = O(5 · 220

100

On pages 303-305, Conclusions section. Sentences ”Small average values of

the agap and σ on large-scale data set, with real dimensions with up to 2500 user

nodes, show stability of the algorithm, with the small average computational time

shows algorithm’s eﬃciency. Thus, the proposed ISA algorithm represents a

promising method for this and similar problems related to online social networks

involving large number of users.” is false, because ISA can not reach the optimal

solution even for very small instance from Example 1 with m = 16, n = 6, p =

4! Additionally, complexity of the problem is completely false presented that

depends crucially on the size of m, although it is clear that the complexity of

the problem depends crucially of size n and p and increases linearly with the

increase m.

On pages 304 and 305. Caption of Table 2 ”Results of EA and MA ...”

and caption of Table 3 ”Results of EA and MA on small-size data set” are not

correct. Shortcuts EA i MA does not exist in a given paper, but there are

shortcuts ET (total enumeration) and ISA (iterated simulated annealing).

Example 1 ([1]) . Consider a network with m = 16 user nodes, n = 6

potentialresource nodes and p = 4 established

resources:

83 24 31 63 53 72

74 58 94 43 11 15

8 86 47 79 39 28

14 55 63 29 3 30

37 47 12 12 25 10

20 29 15 66 43 9

0 87 75 95 90 47

14 35 85 13 19 60

54 0

7 16 69 80

78 31 58 26 91 17

10 58 0 58 8 15

, F =

E=

58 83 52 23 36 10

88 90 28 0 63 61

17 58 71 98 31 87

99 11 23 94 0 70

25 31 21 33 20 7

8 64 30 67 48 0

27 66 25 93 9 76

28 46 19 4 82 97

83 2 32 28 35 19

28 47 10 58 69 73

33 24 94 81 54 64

p

4

Conclusions

**In the paper [1] the problem of eﬃcient exploration of data ﬂow within an
**

online social network is considered and the mathematical model that minimizes

the total execution time of the process is developed. However, in the above

4

**sections it was shown that in the paper [1] there are very serious mistakes. It
**

would be good if the author tried to correct those ﬂaws though, as listed in this

paper. Only then will be given a real contribution to solving the Problem of

exploration of online social networks with interaction between research nodes.

References

[1] Miˇskovi´c, S.: Problem of exploration of online social networks with interaction between research nodes. In: Proceedings of the 11th Balkan Conference

on Operations Research - BALCOR’2013, pp. 298–306 (2013)

[2] Petrovi´c A.: A new mixed integer linear programming formulation for

one problem of exploration of online social networks, URL http://www.

optimization-online.org/DB HTML/2014/05/4368.html

[3] Stanimirovi´c, Z.—Miˇskovi´c, S.: Eﬃcient metaheuristic approaches for exploration of online social networks. In: W. Hu, N. Kaabouch (eds.) Big Data

Management, Technologies, and Applications, pp. 222–269. IGI Global,

Hershey, PA (2013)

[4] Stanimirovi´c, Z.—Miˇskovi´c, S.: A hybrid evolutionary algorithm for eﬃcient exploration of online social networks, Computing and Informatics,

Vol. 33, 2014, No. 2, pp. 410–430

[5] Gaji´c, Z.: A several new mixed integer linear programming formulations for

exploration of online social networks. Working papers, Faculty of Technical

Sciences, University of Novi Sad (2014). URL http://www. optimizationonline.org/DB HTML/2014/04/4334.html

5

- Constrained Optimization 1.docxUploaded byErzhan Omarbekov
- A generic approach for nesting 2d parts in 2d sheetsUploaded byRohit Kore
- ITDNW01Uploaded bydericksanthose
- 585-932-1-SMUploaded byTushar K Gohel
- Mathematical Modeling for Business AnalyticsUploaded byhelioteixeira
- F1Uploaded byJason Lin
- Algorithmic Aspects of Wireless Sensor NetworksUploaded bysansiet
- Mathematical Modeling, Analysis and Parameter Estimation on a Heat Conduction ExperimentUploaded byTina Bargo
- Rr210504 Design and Analysis of AlgorithmsUploaded bySrinivasa Rao G
- production controlUploaded byAbdul Nazar
- A Simple and Efficient Algorithm for Solving Type-1 Intuitionistic Fuzzy Solid Transportation ProblemsUploaded byP.SENTHIL KUMAR
- Developing the World Wide Web Using VirtualUploaded bylerikzzz
- (20-21)-search method.pdfUploaded byleksremesh
- Bubble and Dew Point Calculations in Multicomponent and Multireactive MixturesUploaded byAnkit Chugh
- an-innovative-technique-for-design-optimization-of-core-type-phase-distribution-transformer-using-mathematica-2229-8711-3-142.pdfUploaded byKamran Daud Panhwar
- 04 Unit CommitmentUploaded bymohsinaman
- ucflUploaded byDrGopi Krishna
- Optimal Govnt PolicyUploaded byalbertwing1010
- Chapter 10Uploaded byAthir03
- Review of Hooke and Jeeves methodUploaded byaruatscribd
- An Algorithmic Approach for Traveling Salesman Problem UsingUploaded bySamina Fazilat
- Load Balancing Approach in Heterogeneous Distributed Systems - A ReviewUploaded byInnovative Research Publications
- OptiStruct_01_Design Concept for a Structural C-ClipUploaded byBaljinder Singh
- Montiel Dimitrakopoulos 2013Uploaded byJOSE CARLOS MAMANI VALERIANO
- Flyer for RUppalariUploaded byAtiyoBanerjee
- Multiobjective OptimizationUploaded byRaghuveer Chandra
- Tutorial Scia OptimizerUploaded byanonima_beb
- Introduction to Linear OptimizationUploaded byIftikar Alam
- Design for Structural and Energy Performance of Long Span Buildings Using Geometric Multi Objective Optimization_2016Uploaded byJohn Chiv
- Design and Control of Equalization TanksUploaded byDauren Gabbasov