Integer programming approaches for minimum stabbing problems

DOI10.1051/RO/2014008MaRDI QIDQ5418014zbMATH OpenOpenAlexFDO

Authors Breno Piva, Y. Frota, L. Simonetti, Cid Carvalho de Souza

Publication date 26 May 2014

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2014__48_2_211_0/

zbMATH Keywords

branch-and-boundbranch-and-cutinteger programmingLagrangian relaxationstabbing problems

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The minimum stabbing triangulation problem: IP models and computational evaluation
• Fixed-parameter tractability and lower bounds for stabbing problems
• An approach to the solution of integer optimization problems
• Interval Stabbing Problems in Small Integer Ranges
• Integer programming in parameterized complexity: three miniatures
• scientific article; zbMATH DE number 781263
• scientific article; zbMATH DE number 1305459
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• Integer programming as a framework for optimization and approximability
• Integer programming in parameterized complexity: five miniatures

Cited in

(4)

• Minimizing the stabbing number of matchings, trees, and triangulations
• The minimum stabbing triangulation problem: IP models and computational evaluation
• Interval Stabbing Problems in Small Integer Ranges
• Algorithms for high dimensional stabbing problems

This page was built for publication: Integer programming approaches for minimum stabbing problems

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