IDEAS home Printed from https://ideas.repec.org/r/cor/louvrp/334.html
   My bibliography  Save this item

An analysis of approximations for maximizing submodular set functions - 1

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan, 2015. "An accelerated continuous greedy algorithm for maximizing strong submodular functions," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1107-1124, November.
  2. Piotr Faliszewski & Piotr Skowron & Arkadii Slinko & Nimrod Talmon, 2018. "Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(3), pages 513-550, October.
  3. Shang, Jiaxing & Wu, Hongchun & Zhou, Shangbo & Zhong, Jiang & Feng, Yong & Qiang, Baohua, 2018. "IMPC: Influence maximization based on multi-neighbor potential in community networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1085-1103.
  4. Qiufen Ni & Hongwei Du, 2021. "On strict submodularity of social influence," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 348-356, February.
  5. Vahideh Sadat Abedi & Oded Berman & Dmitry Krass, 2014. "Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth," Operations Research, INFORMS, vol. 62(5), pages 994-1013, October.
  6. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 2022. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1125-1148, July.
  7. Goldengorin, Boris & Vink, Marius de, 1999. "Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms," Research Report 99A50, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  8. Yajing Liu & Zhenliang Zhang & Edwin K. P. Chong & Ali Pezeshki, 2018. "Performance Bounds with Curvature for Batched Greedy Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 535-562, May.
  9. Uzma Mushtaque & Jennifer A. Pazour, 2022. "Assortment optimization under cardinality effects and novelty for unequal profit margin items," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(1), pages 106-126, February.
  10. Malings, C. & Pozzi, M., 2019. "Submodularity issues in value-of-information-based sensor placement," Reliability Engineering and System Safety, Elsevier, vol. 183(C), pages 93-103.
  11. Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan, 2016. "Approximation for maximizing monotone non-decreasing set functions with a greedy method," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 29-43, January.
  12. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
  13. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
  14. Toru Kitagawa & Guanyi Wang, 2021. "Who should get vaccinated? Individualized allocation of vaccines over SIR network," CeMMAP working papers CWP28/21, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
  15. Takanori Maehara & Kazuo Murota, 2015. "Valuated matroid-based algorithm for submodular welfare problem," Annals of Operations Research, Springer, vol. 229(1), pages 565-590, June.
  16. Ali Koç & David P. Morton, 2015. "Prioritization via Stochastic Optimization," Management Science, INFORMS, vol. 61(3), pages 586-603, March.
  17. Weili Wu & Hongwei Du & Huijuan Wang & Lidong Wu & Zhenhua Duan & Cong Tian, 2018. "On general threshold and general cascade models of social influence," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 209-215, January.
  18. Shaojie Tang & Jing Yuan, 2021. "Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2143-2161, July.
  19. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
  20. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 0. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
  21. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
  22. Hyoshin (John) Park & Ali Haghani & Song Gao & Michael A. Knodler & Siby Samuel, 2018. "Anticipatory Dynamic Traffic Sensor Location Problems with Connected Vehicle Technologies," Service Science, INFORMS, vol. 52(6), pages 1299-1326, December.
  23. Alfredo Torrico & Mohit Singh & Sebastian Pokutta & Nika Haghtalab & Joseph (Seffi) Naor & Nima Anari, 2021. "Structured Robust Submodular Maximization: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1590-1607, October.
  24. Maxime C. Cohen & Ngai-Hang Zachary Leung & Kiran Panchamgam & Georgia Perakis & Anthony Smith, 2017. "The Impact of Linear Optimization on Promotion Planning," Operations Research, INFORMS, vol. 65(2), pages 446-468, April.
  25. Zhigang Li & Mingchuan Zhang & Junlong Zhu & Ruijuan Zheng & Qikun Zhang & Qingtao Wu, 2018. "Stochastic Block-Coordinate Gradient Projection Algorithms for Submodular Maximization," Complexity, Hindawi, vol. 2018, pages 1-11, December.
  26. Hao-Hsiang Wu & Simge Küçükyavuz, 2018. "A two-stage stochastic programming approach for influence maximization in social networks," Computational Optimization and Applications, Springer, vol. 69(3), pages 563-595, April.
  27. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
  28. Alper Atamtürk & Andrés Gómez, 2017. "Maximizing a Class of Utility Functions Over the Vertices of a Polytope," Operations Research, INFORMS, vol. 65(2), pages 433-445, March-Apr.
  29. Min Cui & Dachuan Xu & Longkun Guo & Dan Wu, 2022. "Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1671-1690, July.
  30. Yu Zhang & Vidyadhar Kulkarni, 2018. "Automated Teller Machine Replenishment Policies with Submodular Costs," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 517-530, July.
  31. Yingli Ran & Zhao Zhang & Ker-I Ko & Jun Liang, 2016. "An approximation algorithm for maximum weight budgeted connected set cover," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1505-1517, May.
  32. Abdolmajid Yolmeh & Melike Baykal-Gürsoy, 2018. "Urban rail patrolling: a game theoretic approach," Journal of Transportation Security, Springer, vol. 11(1), pages 23-40, June.
  33. Manuel A. Nunez & Robert S. Garfinkel & Ram D. Gopal, 2007. "Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction," Operations Research, INFORMS, vol. 55(5), pages 890-908, October.
  34. Jon Lee & Maxim Sviridenko & Jan Vondrák, 2010. "Submodular Maximization over Multiple Matroids via Generalized Exchange Properties," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 795-806, November.
  35. Thomas Parmer & Luis M. Rocha & Filippo Radicchi, 2022. "Influence maximization in Boolean networks," Nature Communications, Nature, vol. 13(1), pages 1-11, December.
  36. Çömez-Dolgan, Nagihan & Fescioglu-Unver, Nilgun & Cephe, Ecem & Şen, Alper, 2021. "Capacitated strategic assortment planning under explicit demand substitution," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1120-1138.
  37. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.
  38. Carri W. Chan & Vivek F. Farias, 2009. "Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 333-350, May.
  39. Tanınmış, Kübra & Aras, Necati & Altınel, I.K., 2019. "Influence maximization with deactivation in social networks," European Journal of Operational Research, Elsevier, vol. 278(1), pages 105-119.
  40. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2017. "Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 767-779, November.
  41. Toru Kitagawa & Guanyi Wang, 2020. "Who Should Get Vaccinated? Individualized Allocation of Vaccines Over SIR Network," Papers 2012.04055, arXiv.org, revised Jul 2021.
  42. Maxim Sviridenko & Jan Vondrák & Justin Ward, 2017. "Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1197-1218, November.
  43. Martin B. Haugh & Raghav Singal, 2021. "How to Play Fantasy Sports Strategically (and Win)," Management Science, INFORMS, vol. 67(1), pages 72-92, January.
  44. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.
  45. Li, Ruolin & Mehr, Negar & Horowitz, Roberto, 2023. "Submodularity of optimal sensor placement for traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 29-43.
  46. Bin Liu & Zihan Chen & Huijuan Wang & Weili Wu, 2023. "An optimal streaming algorithm for non-submodular functions maximization on the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-17, January.
  47. Arash Asadpour & Hamid Nazerzadeh, 2016. "Maximizing Stochastic Monotone Submodular Functions," Management Science, INFORMS, vol. 62(8), pages 2374-2391, August.
  48. repec:dgr:rugsom:99a17 is not listed on IDEAS
  49. Kitagawa, Toru & Wang, Guanyi, 2023. "Who should get vaccinated? Individualized allocation of vaccines over SIR network," Journal of Econometrics, Elsevier, vol. 232(1), pages 109-131.
  50. George Nemhauser, 2007. "Hooked on IP," Annals of Operations Research, Springer, vol. 149(1), pages 157-161, February.
  51. Yijing Wang & Dachuan Xu & Yishui Wang & Dongmei Zhang, 2020. "Non-submodular maximization on massive data streams," Journal of Global Optimization, Springer, vol. 76(4), pages 729-743, April.
  52. Zihan Chen & Bin Liu & Hongmin W. Du, 2023. "Streaming submodular maximization under d-knapsack constraints," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
  53. Majun Shi & Zishen Yang & Donghyun Kim & Wei Wang, 2021. "Non-monotone submodular function maximization under k-system constraint," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 128-142, January.
  54. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
  55. Sekar, Shreyas & Vojnovic, Milan & Yun, Se-Young, 2020. "A test score based approach to stochastic submodular optimization," LSE Research Online Documents on Economics 103176, London School of Economics and Political Science, LSE Library.
  56. Ruiqi Yang & Dachuan Xu & Yanjun Jiang & Yishui Wang & Dongmei Zhang, 2019. "Approximating Robust Parameterized Submodular Function Maximization in Large-Scales," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-24, August.
  57. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
  58. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin, 2023. "The follower competitive facility location problem under the nested logit choice rule," European Journal of Operational Research, Elsevier, vol. 310(2), pages 834-846.
  59. Meng, Yanhong & Yi, Yunhui & Xiong, Fei & Pei, Changxing, 2019. "T×oneHop approach for dynamic influence maximization problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 575-586.
  60. Niv Buchbinder & Moran Feldman, 2019. "Constrained Submodular Maximization via a Nonsymmetric Technique," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 988-1005, August.
  61. Shaojie Tang & Jing Yuan, 2023. "Beyond submodularity: a unified framework of randomized set selection with group fairness constraints," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-22, May.
  62. Hongjie Guo & Jianzhong Li & Hong Gao, 2022. "Data source selection for approximate query," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2443-2459, November.
  63. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.
  64. Zhou, Rui & Bhuiyan, Tanveer Hossain & Medal, Hugh R. & Sherwin, Michael D. & Yang, Dong, 2022. "A stochastic programming model with endogenous uncertainty for selecting supplier development programs to proactively mitigate supplier risk," Omega, Elsevier, vol. 107(C).
  65. Yanzhi Li & Zhicheng Liu & Chuchu Xu & Ping Li & Xiaoyan Zhang & Hong Chang, 2023. "Two-stage submodular maximization under curvature," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-16, March.
  66. Baojun Ma & Qiang Wei & Guoqing Chen & Jin Zhang & Xunhua Guo, 2017. "Content and Structure Coverage: Extracting a Diverse Information Subset," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 660-675, November.
  67. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
  68. Bich-Ngan T. Nguyen & Phuong N. H. Pham & Van-Vang Le & Václav Snášel, 2022. "Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice," Mathematics, MDPI, vol. 10(20), pages 1-19, October.
  69. Xiaojuan Zhang & Qian Liu & Min Li & Yang Zhou, 2022. "Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3549-3574, December.
  70. Samuel V Scarpino & Nedialko B Dimitrov & Lauren Ancel Meyers, 2012. "Optimizing Provider Recruitment for Influenza Surveillance Networks," PLOS Computational Biology, Public Library of Science, vol. 8(4), pages 1-12, April.
  71. Kahr, Michael & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Benders decomposition for competitive influence maximization in (social) networks," Omega, Elsevier, vol. 100(C).
  72. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
  73. Orhan Karasakal & Nur Evin Özdemirel & Levent Kandiller, 2011. "Anti‐ship missile defense for a naval task group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 304-321, April.
  74. Shaoning Han & Andrés Gómez & Oleg A. Prokopyev, 2022. "Fractional 0–1 programming and submodularity," Journal of Global Optimization, Springer, vol. 84(1), pages 77-93, September.
  75. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
  76. Toru Kitagawa & Guanyi Wang, 2023. "Individualized Treatment Allocation in Sequential Network Games," Papers 2302.05747, arXiv.org, revised Jul 2024.
  77. Ariah Klages-Mundt & Andreea Minca, 2021. "Optimal Intervention in Economic Networks using Influence Maximization Methods," Papers 2102.01800, arXiv.org, revised Mar 2023.
  78. Xin Chen & Qingqin Nong & Yan Feng & Yongchang Cao & Suning Gong & Qizhi Fang & Ker-I Ko, 2017. "Centralized and decentralized rumor blocking problems," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 314-329, July.
  79. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
  80. Toru Kitagawa & Guanyi Wang, 2020. "Who should get vaccinated? Individualized allocation of vaccines over SIR network," CeMMAP working papers CWP59/20, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
  81. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2023. "Robust maximum capture facility location under random utility maximization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1128-1150.
  82. Yanfei Lu & Zihan Zhao & Bowu Zhang & Qinghe Gao, 2019. "An advertisement dissemination strategy with maximal influence for Internet-of-Vehicles," International Journal of Distributed Sensor Networks, , vol. 15(11), pages 15501477198, November.
  83. Hao Shen & Yong Liang & Zuo-Jun Max Shen, 2021. "Reliable Hub Location Model for Air Transportation Networks Under Random Disruptions," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 388-406, March.
  84. Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo, 2022. "Election control through social influence with voters’ uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 635-669, August.
  85. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
  86. Cheng Lu & Wenguo Yang & Suixiang Gao, 2022. "A new greedy strategy for maximizing monotone submodular function under a cardinality constraint," Journal of Global Optimization, Springer, vol. 83(2), pages 235-247, June.
  87. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
  88. Stephan Foldes & Peter L. Hammer, 2005. "Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 453-461, May.
  89. Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
  90. Kemin Yu & Min Li & Yang Zhou & Qian Liu, 2023. "On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-21, April.
  91. Klages-Mundt, Ariah & Minca, Andreea, 2022. "Optimal intervention in economic networks using influence maximization methods," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1136-1148.
  92. Ruiqi Yang & Dachuan Xu & Longkun Guo & Dongmei Zhang, 2021. "Sequence submodular maximization meets streaming," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 43-55, January.
  93. Yingfei Wang & Inbal Yahav & Balaji Padmanabhan, 2024. "Smart Testing with Vaccination: A Bandit Algorithm for Active Sampling for Managing COVID-19," Information Systems Research, INFORMS, vol. 35(1), pages 120-144, March.
  94. Suning Gong & Qingqin Nong & Wenjing Liu & Qizhi Fang, 2019. "Parametric monotone function maximization with matroid constraints," Journal of Global Optimization, Springer, vol. 75(3), pages 833-849, November.
  95. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
  96. Canh V. Pham & Quang C. Vu & Dung K. T. Ha & Tai T. Nguyen & Nguyen D. Le, 2022. "Maximizing k-submodular functions under budget constraint: applications and streaming algorithms," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 723-751, August.
  97. Lin Zhang & Kan Li, 2022. "Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks," Mathematics, MDPI, vol. 10(8), pages 1-20, April.
  98. Chandra Chekuri & Tanmay Inamdar & Kent Quanrud & Kasturi Varadarajan & Zhao Zhang, 2022. "Algorithms for covering multiple submodular constraints and applications," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 979-1010, September.
  99. Xin Sun & Gaidi Li & Yapu Zhang & Zhenning Zhang, 2022. "Private non-monotone submodular maximization," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3212-3232, December.
  100. Hemant Gehlot & Shreyas Sundaram & Satish V. Ukkusuri, 2023. "Algorithms for influence maximization in socio-physical networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-28, January.
  101. Shaojie Tang & Siyuan Liu & Xu Han & Yu Qiao, 2022. "Toward Robust Monitoring of Malicious Outbreaks," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1257-1271, March.
  102. Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
  103. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
  104. Ali Aouad & Retsef Levi & Danny Segev, 2019. "Approximation Algorithms for Dynamic Assortment Optimization Models," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 487-511, May.
  105. Chenggang Wang & Zengfu Wang & Xiong Xu & Yuhang Hao, 2021. "A balanced sensor scheduling for multitarget localization in a distributed multiple-input multiple-output radar network," International Journal of Distributed Sensor Networks, , vol. 17(7), pages 15501477211, July.
  106. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
  107. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
  108. repec:dgr:rugsom:99a50 is not listed on IDEAS
  109. Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  110. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2021. "Maximizing Sequence-Submodular Functions and Its Application to Online Advertising," Management Science, INFORMS, vol. 67(10), pages 6030-6054, October.
  111. Marek Adamczyk & Maxim Sviridenko & Justin Ward, 2016. "Submodular Stochastic Probing on Matroids," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1022-1038, August.
  112. Kung, Ling-Chieh & Liao, Wei-Hung, 2018. "An approximation algorithm for a competitive facility location problem with network effects," European Journal of Operational Research, Elsevier, vol. 267(1), pages 176-186.
  113. Siddharth Patwardhan & Marc Barthelemy & Şirag Erkol & Santo Fortunato & Filippo Radicchi, 2024. "Symmetry breaking in optimal transport networks," Nature Communications, Nature, vol. 15(1), pages 1-9, December.
  114. Cheng Lu & Wenguo Yang & Ruiqi Yang & Suixiang Gao, 2022. "Maximizing a non-decreasing non-submodular function subject to various types of constraints," Journal of Global Optimization, Springer, vol. 83(4), pages 727-751, August.
  115. Jason J. Sauppe & Sheldon H. Jacobson & Edward C. Sewell, 2014. "Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 547-566, August.
  116. Niv Buchbinder & Moran Feldman & Roy Schwartz, 2017. "Comparing Apples and Oranges: Query Trade-off in Submodular Maximization," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 308-329, May.
  117. Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
  118. Shreyas Sekar & Milan Vojnovic & Se-Young Yun, 2021. "A Test Score-Based Approach to Stochastic Submodular Optimization," Management Science, INFORMS, vol. 67(2), pages 1075-1092, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.