Improved Computational Approaches and Heuristics for Zero Forcing
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2020.1032
Download full text from publisher
References listed on IDEAS
- Chun-Ying Chiang & Liang-Hao Huang & Bo-Jr Li & Jiaojiao Wu & Hong-Gwa Yeh, 2013. "Some results on the target set selection problem," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 702-715, May.
- Matteo Fischetti, 1991. "Facets of the Asymmetric Traveling Salesman Polytope," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 42-56, February.
- Chassidy Bozeman & Boris Brimkov & Craig Erickson & Daniela Ferrero & Mary Flagg & Leslie Hogben, 2019. "Restricted power domination and zero forcing problems," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 935-956, April.
- Ashkan Aazami, 2010. "Domination in graphs with bounded propagation: algorithms, formulations and hardness results," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 429-456, May.
- Maguy TREFOIS & Jean-Charles DELVENNE, 2015. "Zero forcing number, constrained matchings and strong structural controllability," LIDAM Reprints CORE 2785, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Brimkov, Boris & Fast, Caleb C. & Hicks, Illya V., 2019. "Computational approaches for zero forcing and related problems," European Journal of Operational Research, Elsevier, vol. 273(3), pages 889-903.
- Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot, 2020. "Power domination on triangular grids with triangular and hexagonal shape," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 482-500, August.
- Shuchao Li & Wanting Sun, 2020. "On the zero forcing number of a graph involving some classical parameters," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 365-384, February.
- Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot, 0. "Power domination on triangular grids with triangular and hexagonal shape," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-19.
- Michiel A. J. uit het Broek & Albert H. Schrotenboer & Bolor Jargalsaikhan & Kees Jan Roodbergen & Leandro C. Coelho, 2021. "Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm," Operations Research, INFORMS, vol. 69(2), pages 380-409, March.
- Xianliang Liu & Zishen Yang & Wei Wang, 2021. "The t-latency bounded strong target set selection problem in some kinds of special family of graphs," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 105-117, January.
- Boris Brimkov & Derek Mikesell & Logan Smith, 2019. "Connected power domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 292-315, July.
- Chao Wang & Lei Chen & Changhong Lu, 2016. "$$k$$ k -Power domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 865-873, February.
- Roger Z. Ríos-Mercado & Jonathan F. Bard, 2003. "The Flow Shop Scheduling Polyhedron with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 291-318, September.
- Gu-Fang Mou & Tian-Fei Wang & Zhong-Shan Li, 2020. "The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix," Mathematics, MDPI, vol. 8(3), pages 1-14, March.
- Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
- Quoc Trung Bui & Yves Deville & Quang Dung Pham, 2016. "Exact methods for solving the elementary shortest and longest path problems," Annals of Operations Research, Springer, vol. 244(2), pages 313-348, September.
- Chun-Ying Chiang & Wei-Ting Huang & Hong-Gwa Yeh, 2016. "Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 815-832, February.
- Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
- Chung-Shou Liao, 2016. "Power domination with bounded time constraints," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 725-742, February.
- Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
- Subramanyam, Anirudh & Gounaris, Chrysanthos E., 2016. "A branch-and-cut framework for the consistent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(2), pages 384-395.
- Haining Jiang, 2020. "Target Set Selection on generalized pancake graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(2), pages 379-389, June.
- Liao, Chung-Shou & Hsieh, Tsung-Jung & Guo, Xian-Chang & Liu, Jian-Hong & Chu, Chia-Chi, 2015. "Hybrid search for the optimal PMU placement problem on a power grid," European Journal of Operational Research, Elsevier, vol. 243(3), pages 985-994.
- Daniela Ferrero & Leslie Hogben & Franklin H. J. Kenter & Michael Young, 2017. "Note on power propagation time and lower bounds for the power domination number," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 736-741, October.
More about this item
Keywords
zero forcing; Boolean satisfiability; heuristic; constraint generation;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:33:y:2021:i:4:p:1384-1399. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.