ILP-Based Local Search for Graph Partitioning (Q6039924): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3045798073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent directions in netlist partitioning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral partitioning with multiple eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2889270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Combinatorial Branch-and-Bound for Graph Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Graph Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal solutions to the graph partitioning problem with heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / 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: Nested Dissection of a Regular Finite Element Mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / 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: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using linear and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundant constraints in the standard formulation for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs to speedup Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Multilevel Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897735 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:34, 1 August 2024

scientific article; zbMATH DE number 7688304
Language Label Description Also known as
English
ILP-Based Local Search for Graph Partitioning
scientific article; zbMATH DE number 7688304

    Statements

    ILP-Based Local Search for Graph Partitioning (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2023
    0 references
    balanced graph partitioning
    0 references
    evolutionary algorithm
    0 references
    integer linear programming
    0 references
    local search algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references