A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ai-Fan Ling / rank
Normal rank
 
Property / author
 
Property / author: Cheng-Xian Xu / rank
Normal rank
 
Property / author
 
Property / author: Ai-Fan Ling / rank
 
Normal rank
Property / author
 
Property / author: Cheng-Xian Xu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / 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.1016/j.ejor.2008.07.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991198724 / 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: 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approach to nonlinear integer programming / 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 Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of augmented filled functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete global descent method for discrete global optimization and nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete filled function method for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer on global integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled functions for unconstrained global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5716604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of quasi-Newton equations and quasi-Newton methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new discrete filled function algorithm for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:17, 1 July 2024

scientific article
Language Label Description Also known as
English
A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
scientific article

    Statements

    A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    combinatorial optimization
    0 references
    global optimization
    0 references
    filled function
    0 references
    max-cut
    0 references
    continuation method
    0 references
    local search
    0 references

    Identifiers