Kernel technology to solve discrete optimization problems
type: Item
instance of: scholarly article
title: Kernel technology to solve discrete optimization problems
zbMATH Open document ID: 1387.90176
published in: Cybernetics and Systems Analysis
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6842760
zbMATH Keywords: kernel technology
zbMATH Keywords: quadratic assignment problem QAP
zbMATH Keywords: problem of maximum weighted cut of a graph WMaxCut
zbMATH Keywords: traveling salesman problem TSP
zbMATH Keywords: Boolean quadratic programming problem UBQP
zbMATH Keywords: job scheduling problem JSP
zbMATH Keywords: computing experiment
zbMATH Keywords: comparative study of algorithms
author: I. V. Sergienko
author: V. P. Shylo
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10559-017-9990-y
OpenAlex ID: W2768702749
cites work: Q4217266
cites work: The method of global equilibrium search
cites work: Quadratic assignment problems
cites work: Solving unconstrained binary quadratic programming problem by global equilibrium search
cites work: An algorithm for the job shop scheduling problem based on global equilibrium search techniques
cites work: A cooperative parallel tabu search algorithm for the quadratic assignment problem
cites work: Q5313598
cites work: Breakout local search for the quadratic assignment problem
cites work: Iterated local search for the quadratic assignment problem
cites work: Q4354785
cites work: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
cites work: Problems of discrete optimization: challenges and main approaches to solve them
DOI: 10.1007/S10559-017-9990-Y
description: scientific article; zbMATH DE number 6842760