Fragmentary structures in discrete optimization problems

DOI10.1007/S10559-017-9995-6MaRDI QIDQ1699407zbMATH OpenOpenAlexFDO

Authors I. V. Kozin, N. K. Maksyshko, V. A. Perepelitsa

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-9995-6

zbMATH Keywords

evolutionary algorithmdiscrete optimizationant algorithmlocal algorithmfragmentary structure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A combinatorial algorithm for the discrete optimization of structures
• scientific article; zbMATH DE number 4051356
• scientific article; zbMATH DE number 6444271
• Fragmentary structures in a two-dimensional strip packing problem
• Optimization on the combinatorial set of permutations in inexact input data conditions

Cites work

• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• A comprehensive review and evaluation of permutation flowshop heuristics
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• Ant algorithms: theory and applications
• Evolutionary-fragmentary model of pentamino packing
• Genetic algorithms: state of the art, problems, and perspectives
• Greedoids
• On the Abstract Properties of Linear Dependence

Cited in

(2)

• A fragmented model for the problem of land use on hypergraphs
• Fragmentary structures in a two-dimensional strip packing problem

This page was built for publication: Fragmentary structures in discrete optimization problems

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