A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs (Q518138): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6697600 / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer programming
Property / zbMATH Keywords: mixed integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
graph partitioning
Property / zbMATH Keywords: graph partitioning / rank
 
Normal rank
Property / zbMATH Keywords
 
demand vertex
Property / zbMATH Keywords: demand vertex / rank
 
Normal rank
Property / zbMATH Keywords
 
supply vertex
Property / zbMATH Keywords: supply vertex / rank
 
Normal rank

Revision as of 04:40, 1 July 2023

scientific article
Language Label Description Also known as
English
A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
scientific article

    Statements

    A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs (English)
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    mixed integer programming
    0 references
    graph partitioning
    0 references
    demand vertex
    0 references
    supply vertex
    0 references

    Identifiers