IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i2p1283-1292.html
   My bibliography  Save this article

A packet filter placement problem with application to defense against spoofed denial of service attacks

Author

Listed:
  • Armbruster, Benjamin
  • Smith, J. Cole
  • Park, Kihong

Abstract

No abstract is available for this item.

Suggested Citation

  • Armbruster, Benjamin & Smith, J. Cole & Park, Kihong, 2007. "A packet filter placement problem with application to defense against spoofed denial of service attacks," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1283-1292, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:1283-1292
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00829-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Conforti, Michele & Cornuejols, Gerard & Kapoor, Ajai & Vuskovic, Kristina, 2001. "Perfect, ideal and balanced matrices," European Journal of Operational Research, Elsevier, vol. 133(3), pages 455-461, September.
    2. Hochbaum, Dorit S., 2002. "Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations," European Journal of Operational Research, Elsevier, vol. 140(2), pages 291-321, July.
    3. Marshall L. Fisher & Pradeep Kedia, 1990. "Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics," Management Science, INFORMS, vol. 36(6), pages 674-688, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. E. Chisonge Mofya & J. Cole Smith, 2009. "A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 322-332, May.

    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.
    1. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    2. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    3. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    4. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.
    5. Yuceer, Umit, 1997. "A multi-product loading problem: a model and solution method," European Journal of Operational Research, Elsevier, vol. 101(3), pages 519-531, September.
    6. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    7. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    8. Farahani, Reza Zanjirani & Asgari, Nasrin, 2007. "Combination of MCDM and covering techniques in a hierarchical model for facility location: A case study," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1839-1858, February.
    9. Hassin, Refael & Or, Einat, 2010. "Min sum clustering with penalties," European Journal of Operational Research, Elsevier, vol. 206(3), pages 547-554, November.
    10. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    11. Roberto Asín Achá & Dorit S. Hochbaum & Quico Spaen, 2020. "HNCcorr: combinatorial optimization for neuron identification," Annals of Operations Research, Springer, vol. 289(1), pages 5-32, June.
    12. Suresh K. Nair & Ravi Bapna, 2001. "An application of yield management for Internet Service Providers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 348-362, August.
    13. Koutras, M. V. & Tsitmidelis, S. & Zissimopoulos, V., 2003. "Evaluation of reliability bounds by set covering models," Statistics & Probability Letters, Elsevier, vol. 61(2), pages 163-175, January.
    14. Baumann, P. & Hochbaum, D.S. & Yang, Y.T., 2019. "A comparative study of the leading machine learning techniques and two new optimization algorithms," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1041-1057.
    15. Jeff T. Linderoth & Eva K. Lee & Martin W. P. Savelsbergh, 2001. "A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 191-209, August.
    16. Kedong Yan & Dongjing Miao & Cui Guo & Chanying Huang, 2021. "Efficient feature selection for logical analysis of large-scale multi-class datasets," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 1-23, July.
    17. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    18. Kroon, L.G. & Fischetti, M., 2000. "Crew Scheduling for Netherlands Railways: "destination: customer"," ERIM Report Series Research in Management ERS-2000-56-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    19. Nepal, Bimal & Lassan, Gregg & Drow, Baba & Chelst, Kenneth, 2009. "A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company," European Journal of Operational Research, Elsevier, vol. 193(1), pages 272-281, February.
    20. Bentz, Cédric & Cornaz, Denis & Ries, Bernard, 2013. "Packing and covering with linear programming: A survey," European Journal of Operational Research, Elsevier, vol. 227(3), pages 409-422.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:eee:ejores:v:176:y:2007:i:2:p:1283-1292. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.