Novel Algorithms for Quadratic Programming by Using Hypergraph Representations

Tisza, Dávid; Oláh, András; Levendovszky, János

doi:10.1007/s11277-014-1639-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At present, the model of hypergraph has been applied in many fields, such as: VLSI layout, electricity network topology analysis. Recently, intelligence algorithms and learning algorithms on hyper-graph and its computer applications are studied by researchers (see [8][9][10][11][12][13][14][15][16][17] for example).…”

Section: Introductionmentioning

confidence: 99%

Algorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting

Zhu¹,

Min²,

Gao³

et al. 2015

TOCSJ

View full text Add to dashboard Cite

Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the execution steps of encoding and decoding are presented. Finally, we manifest the implement procedure.

show abstract

Section: Introductionmentioning

confidence: 99%