Kernel technology to solve discrete optimization problems

DOI10.1007/S10559-017-9990-YMaRDI QIDQ1699399zbMATH OpenOpenAlexFDO

Authors I. V. Sergienko, V. P. Shylo

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)

Recommendations

• Solving the quadratic assignment problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Kernel search: a new heuristic framework for portfolio selection
• scientific article; zbMATH DE number 4061003
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2201174 (Why is no real title available?)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• An algorithm for the job shop scheduling problem based on global equilibrium search techniques
• Breakout local search for the quadratic assignment problem
• Iterated local search for the quadratic assignment problem
• Problems of discrete optimization: challenges and main approaches to solve them
• Quadratic assignment problems
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• The method of global equilibrium search

Cited in

(2)

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

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699399)