Memetic search for the max-bisection problem (Q339560): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaco / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067182837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / 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: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming based polyhedral cut and price approach for the maxcut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified VNS metaheuristic for max-bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach to solving the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Scatter Search for the Max-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gentle Introduction to Memetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for computing the distance between close partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maxcut problem by the global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic GRASP-tabu search algorithms for the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian net algorithm for solving max-bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank
 
Normal rank

Revision as of 22:03, 12 July 2024

scientific article
Language Label Description Also known as
English
Memetic search for the max-bisection problem
scientific article

    Statements

    Memetic search for the max-bisection problem (English)
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    max-bisection
    0 references
    max-cut
    0 references
    memetic search
    0 references
    evolutionary computing
    0 references
    tabu search
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers