A multiple search operator heuristic for the max-k-cut problem (Q513573): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1510.09156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / 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: A graph-theoretic via minimization algorithm for two-layer printed circuit boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / 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: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Memetic Algorithm for theMax-Bisection Problem / 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: Realignment in the National Football League: Did they do it right? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel / 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: Memetic search for the max-bisection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up a memetic algorithm for the max-bisection problem / rank
 
Normal rank

Latest revision as of 13:12, 13 July 2024

scientific article
Language Label Description Also known as
English
A multiple search operator heuristic for the max-k-cut problem
scientific article

    Statements

    A multiple search operator heuristic for the max-k-cut problem (English)
    0 references
    0 references
    0 references
    7 March 2017
    0 references
    max-k-cut and max-cut
    0 references
    graph partition
    0 references
    multiple search strategies
    0 references
    tabu list
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers