The problem of intractability and analysis of heuristics in discrete optimization. I

zbMath0805.90089MaRDI QIDQ1320831

V. A. Bondarenko

Publication date: 24 May 1994

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

zbMATH Keywords

linear formdiscrete optimization problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Nonsmooth analysis (49J52) Combinatorial optimization (90C27) Mathematical programming (90C99)

This page was built for publication: The problem of intractability and analysis of heuristics in discrete optimization. I