A Subexponential Algorithm for Abstract Optimization Problems

An abstract optimization problem (AOP) is a triple (H, >

Authors

• Bernd Gärtner

Keywords

• Computer applications
• Linear programming
• History
• Algorithm For Problem
• Algorithm For Optimization Problems
• Subexponential Algorithms
• Minimum Distance
• Proof Of Theorem
• Finite Set
• Polyhedral
• Linear Problem
• Convex Hull
• Linear Order
• Small Problems
• Recursive Algorithm
• Polytope
• Framework For Problem
• Simplex Algorithm
• Affine Space
• Consistent Answers
• Circumcircle