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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tree \(t\)-spanners in outerplanar graphs via supply demand partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of partitioning graphs with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Power Supply Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling the Power Supply Network – Hardness and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for solving the problem of partitioning graphs with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric power supply networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Minimum Cost Partition of a Tree with Supply and Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning of supply/demand graphs with capacity limitations: an ant colony approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Distribution Forests of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Distribution Trees of Graphs / rank
 
Normal rank

Latest revision as of 13:51, 13 July 2024

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

    Identifiers