Algorithms for sequential analysis and fathoming in discrete optimization problems

DOI10.1007/BF01078258zbMath0462.90067MaRDI QIDQ3912369

Yu. M. Pozdnyakov, V. L. Volkovich, V. S. Mikhalevich, A. F. Voloshin

Publication date: 1980

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmsdiscrete optimizationsequential analysisfathoming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (3)

Reliability optimization algorithm for a compound system with different backup elements in subsystems ⋮ Choosing the capacity of arcs with constraint on flow delay time ⋮ System optimization in multitest linear programming problems

Cites Work

• Unnamed Item
• Dynamic Programming and "Difficult Crossing" Puzzles
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: Algorithms for sequential analysis and fathoming in discrete optimization problems