On the complexity of discrete programming problems

DOI10.21136/am.1969.103254zbMath0196.22804OpenAlexW4239484130MaRDI QIDQ5592807

Jaroslav Morávek

Publication date: 1969

Full work available at URL: https://eudml.org/doc/14619

zbMATH Keywords

algorithmic complexitylower boundscomplexity indicesnumber of comparisonsdiscrete integer programmingL-S algorithmlinear-separating algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (3)

A geometrical method in combinatorial complexity ⋮ Unnamed Item ⋮ A note upon minimal path problem

Cites Work

• Dynamic Programming Treatment of the Travelling Salesman Problem
• An Algorithm for the Traveling Salesman Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of discrete programming problems