Kernel technology to solve discrete optimization problems

DOI10.1007/s10559-017-9990-yzbMath1387.90176OpenAlexW2768702749MaRDI QIDQ1699399

Vladimir P. Shylo, Ivan V. Sergienko

Publication date: 23 February 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-017-9990-y

zbMATH Keywords

comparative study of algorithmscomputing experimentBoolean quadratic programming problem UBQPjob scheduling problem JSPkernel technologyproblem of maximum weighted cut of a graph WMaxCutquadratic assignment problem QAPtraveling salesman problem TSP

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (2)

Solving the quadratic assignment problem ⋮ Efficient methods to organize the parallel execution of optimization algorithms

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• Quadratic assignment problems
• An algorithm for the job shop scheduling problem based on global equilibrium search techniques
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• The method of global equilibrium search
• Breakout local search for the quadratic assignment problem
• Problems of discrete optimization: challenges and main approaches to solve them
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• Iterated local search for the quadratic assignment problem

This page was built for publication: Kernel technology to solve discrete optimization problems