Multiset graph partitioning
| Autor: | Yaroslav Krylyuk, William W. Hager |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Discrete mathematics
General Mathematics Voltage graph Directed graph Management Science and Operations Research Strength of a graph Butterfly graph law.invention Combinatorics law Line graph Computer Science::Programming Languages Null graph Graph property Software Complement graph MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Mathematical Methods of Operations Research (ZOR). 55:1-10 |
| ISSN: | 1432-5217 1432-2994 |
| DOI: | 10.1007/s001860200173 |
| Popis: | Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|