MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*

DOI10.3233/FI-2020-1941zbMath1496.68300arXiv2106.10685MaRDI QIDQ5140144

Enrico Tronci, Igor Melatti, Toni Mancini, Qian Matteo Chen, Alberto Finzi

Publication date: 14 December 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.10685

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• MiniSat
• COMET
• CPLEX
• Gurobi
• GLPK
• z3
• Sat4j
• vZ
• OptiMathSAT
• sCASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating constraint answer set programming languages and algorithms
• Evaluating ASP and commercial solvers on the CSPLib
• Integrating answer set programming and constraint logic programming
• Exploiting functional dependencies in declarative problem specifications
• On minimising the maximum expected verification time
• Model-driven visualizations of constraint-based local search
• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• Undecidability of Quantized State Feedback Control for Discrete Time Linear Hybrid Systems
• Satisfiability Modulo Theories
• Integer Programming
• Principles of Constraint Programming
• Constraint Answer Set Programming without Grounding
• Now or Never: Negotiating Efficiently with Unknown or Untrusted Counterparts*
• SyLVaaS: System Level Formal Verification as a Service*
• Theory and Applications of Satisfiability Testing

This page was built for publication: MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*