A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-015-1930-5 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1411.1080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient memetic algorithm for the graph partitioning problem / 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: Minimum cost partitions of trees with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lock-gain based graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bionomic approach to the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding neighborhood GRASP for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Power Supply Networks / rank
 
Normal rank
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: Modelling the Power Supply Network – Hardness and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating partitions of a graph into a fixed number of minimum weight cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing finest mincut partitions of a graph and application to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search heuristic for the capacitated clustering problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-015-1930-5 / rank
 
Normal rank

Latest revision as of 12:46, 9 December 2024

scientific article
Language Label Description Also known as
English
A heuristic method for solving the problem of partitioning graphs with supply and demand
scientific article

    Statements

    A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    graph partitioning
    0 references
    greedy algorithm
    0 references
    demand node
    0 references
    supply node
    0 references

    Identifiers