The minimum stabbing triangulation problem: IP models and computational evaluation

DOI10.1007/978-3-642-32147-4_5MaRDI QIDQ3167610zbMATH OpenOpenAlexFDO

Authors Breno Piva, Cid Carvalho de Souza

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ri.ufs.br/handle/riufs/1708

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Integer programming approaches for minimum stabbing problems
• scientific article; zbMATH DE number 6469175
• Minimizing the stabbing number of matchings, trees, and triangulations
• Minimum stabbing rectangular partitions of rectilinear polygons
• New results for the minimum weight triangulation problem

Cited in

(3)

• Minimizing the stabbing number of matchings, trees, and triangulations
• Integer programming approaches for minimum stabbing problems
• scientific article; zbMATH DE number 6469175 (Why is no real title available?)

This page was built for publication: The minimum stabbing triangulation problem: IP models and computational evaluation

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