Solving the maxcut problem by the global equilibrium search (Q466339): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: D. Rodríguez-Gómez / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6361619 / rank
 
Normal rank
Property / zbMATH Keywords
 
cutset
Property / zbMATH Keywords: cutset / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate methods
Property / zbMATH Keywords: approximate methods / rank
 
Normal rank
Property / zbMATH Keywords
 
global equilibrium search
Property / zbMATH Keywords: global equilibrium search / rank
 
Normal rank
Property / zbMATH Keywords
 
computational experiment
Property / zbMATH Keywords: computational experiment / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm efficiency
Property / zbMATH Keywords: algorithm efficiency / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / 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.1007/s10559-010-9256-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145708536 / 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: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of discrete optimization: challenges and main approaches to solve them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global equilibrium search applied to the unconstrained binary quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving weighted MAX-SAT via global equilibrium search / 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: Randomized heuristics for the Max-Cut problem / 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: Advanced Scatter Search for the Max-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Solving the maxcut problem by the global equilibrium search
scientific article

    Statements

    Solving the maxcut problem by the global equilibrium search (English)
    0 references
    0 references
    0 references
    27 October 2014
    0 references
    cutset
    0 references
    approximate methods
    0 references
    global equilibrium search
    0 references
    computational experiment
    0 references
    algorithm efficiency
    0 references

    Identifiers