Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-005-9001-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009528260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search in restricted memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715685 / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sokoban: Enhancing general single-agent search methods using domain knowledge / 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: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint pattern database heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{BIDA}^*\): An improved perimeter search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using learning automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the time complexity of iterative-deepening-\(A^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of linear-space search algorithms / rank
 
Normal rank

Latest revision as of 19:07, 24 June 2024

scientific article
Language Label Description Also known as
English
Finding optimal solutions to the graph partitioning problem with heuristic search
scientific article

    Statements

    Finding optimal solutions to the graph partitioning problem with heuristic search (English)
    0 references
    0 references
    12 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers