Kernel technology to solve discrete optimization problems (Q1699399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving unconstrained binary quadratic programming problem by global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the job shop scheduling problem based on global equilibrium search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative parallel tabu search algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Problems of discrete optimization: challenges and main approaches to solve them / rank
 
Normal rank

Latest revision as of 05:55, 15 July 2024

scientific article
Language Label Description Also known as
English
Kernel technology to solve discrete optimization problems
scientific article

    Statements

    Kernel technology to solve discrete optimization problems (English)
    0 references
    23 February 2018
    0 references
    0 references
    kernel technology
    0 references
    quadratic assignment problem QAP
    0 references
    problem of maximum weighted cut of a graph WMaxCut
    0 references
    traveling salesman problem TSP
    0 references
    Boolean quadratic programming problem UBQP
    0 references
    job scheduling problem JSP
    0 references
    computing experiment
    0 references
    comparative study of algorithms
    0 references
    0 references
    0 references
    0 references