The domination heuristic for LP-type problems

DOI10.1137/1.9781611972894.8MaRDI QIDQ5233567zbMATH OpenOpenAlexFDO

Authors Taras Galkovskyi, B. V. Rubl'ov, B. Gärtner

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972894.8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On geometric optimization with few violated constraints
• scientific article; zbMATH DE number 1775049
• A subexponential bound for linear programming
• Geometric applications of a randomized optimization technique
• A simple sampling lemma: Analysis and applications in geometric optimization

Cited in

(3)

• scientific article; zbMATH DE number 5886655 (Why is no real title available?)
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
• A heuristic approach to domino grid problem

This page was built for publication: The domination heuristic for LP-type problems

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