Intractability and analysis of heuristics for discrete optimization. II

MaRDI QIDQ1320851zbMATH OpenFDO

Authors V. A. Bondarenko

Publication date 24 May 1994

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

heuristicslocal searchgreedy algorithmsapproximate solution of discrete optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3922375
• The problem of intractability and analysis of heuristics in discrete optimization. I
• scientific article; zbMATH DE number 3950207
• scientific article; zbMATH DE number 4019111
• Multiheuristic approach to discrete optimization problems

Cited in

(10)

• scientific article; zbMATH DE number 3922375 (Why is no real title available?)
• The problem of intractability and analysis of heuristics in discrete optimization. I
• Analysis of heuristics.
• scientific article; zbMATH DE number 605175 (Why is no real title available?)
• scientific article; zbMATH DE number 4019111 (Why is no real title available?)
• scientific article; zbMATH DE number 3950207 (Why is no real title available?)
• Interpolating greedy and reluctant algorithms
• Analysis of discrete optimization algorithms using incomplete information
• scientific article; zbMATH DE number 4100502 (Why is no real title available?)
• Multiheuristic approach to discrete optimization problems

This page was built for publication: Intractability and analysis of heuristics for discrete optimization. II

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