On the complexity of discrete programming problems

DOI10.21136/AM.1969.103254MaRDI QIDQ5592807zbMATH OpenOpenAlexFDO

Authors Jaroslav Morávek

Publication date 1969

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

zbMATH Keywords

lower boundsalgorithmic complexitycomplexity indicesnumber of comparisonsdiscrete integer programmingL-S algorithmlinear-separating algorithms

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3121282 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5071477 (Why is no real title available?)
• scientific article; zbMATH DE number 3225720 (Why is no real title available?)
• scientific article; zbMATH DE number 3314811 (Why is no real title available?)
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Algorithm for the Traveling Salesman Problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Methods for solving engineering problems using analog computers. Chapters 9 and 10 contributed by Arnold Levine

Cited in

(7)

• On the complexity of data disjunctions.
• scientific article; zbMATH DE number 1873242 (Why is no real title available?)
• On some decision problems in programming
• A geometrical method in combinatorial complexity
• scientific article; zbMATH DE number 3298488 (Why is no real title available?)
• A note upon minimal path problem
• scientific article; zbMATH DE number 3393931 (Why is no real title available?)

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

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