A geometrical method in combinatorial complexity

DOI10.21136/am.1981.103900zbMath0454.68028OpenAlexW2735507719MaRDI QIDQ3902478

Jaroslav Morávek

Publication date: 1981

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

zbMATH Keywords

knapsack problemdecomposition of polyhedral sets into convex setslower bound for the number of comparisons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
• Time bounds for selection
• A note upon minimal path problem
• Solving Production Smoothing Problems
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• On the complexity of discrete programming problems
• Bounds on Threshold Gate Realizability
• A sorting problem and its complexity

This page was built for publication: A geometrical method in combinatorial complexity