An effective iterated tabu search for the maximum bisection problem (Q1652221): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2016.12.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2563073959 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56524032 / 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: Experimental Methods for the Analysis of Optimization Algorithms / 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: 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: 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: An exact combinatorial algorithm for minimum graph bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing breaks by maximizing cuts. / 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: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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 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: A modified VNS metaheuristic for max-bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / 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: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling / 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: An iterated local search heuristic for the split delivery vehicle routing problem / 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: A new Lagrangian net algorithm for solving max-bisection problems / 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 02:09, 16 July 2024

scientific article
Language Label Description Also known as
English
An effective iterated tabu search for the maximum bisection problem
scientific article

    Statements

    An effective iterated tabu search for the maximum bisection problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    max-bisection
    0 references
    graph partition
    0 references
    multiple search strategies
    0 references
    tabu search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    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