Finding minimum stopping and trapping sets: an integer linear programming approach

DOI10.1007/978-3-319-96151-4_34zbMATH Open1404.90121OpenAlexW2883453084MaRDI QIDQ1661914FDOQ1661914

Authors: Alvaro Velasquez, Steven L. Drager, K. Subramani 

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_34

Recommendations

• On the complexity of and solutions to the minimum stopping and trapping set problems
• Linear Programming Formulation for Optimal Stopping Problems
• On the Hardness of Approximating Stopping and Trapping Sets
• The stop number minimization problem: complexity and polyhedral analysis
• scientific article; zbMATH DE number 2015371
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
• A Forward Algorithm for Solving Optimal Stopping Problems
• A minimum trapping time problem in optimal control theory
• On approximative solutions of multistopping problems
• Locating Minimal Infeasible Constraint Sets in Linear Programs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (2)

• Computing the Stopping Distance of a Tanner Graph Is NP-Hard
• On the complexity of and solutions to the minimum stopping and trapping set problems

This page was built for publication: Finding minimum stopping and trapping sets: an integer linear programming approach

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