IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v36y2002i9p789-803.html
   My bibliography  Save this article

A mixed integer knapsack model for allocating funds to highway safety improvements

Author

Listed:
  • Melachrinoudis, Emanuel
  • Kozanidis, George

Abstract

No abstract is available for this item.

Suggested Citation

  • Melachrinoudis, Emanuel & Kozanidis, George, 2002. "A mixed integer knapsack model for allocating funds to highway safety improvements," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 789-803, November.
    • Handle: RePEc:eee:transa:v:36:y:2002:i:9:p:789-803
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965-8564(01)00040-4
    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. Prabhakant Sinha & Andris A. Zoltners, 1979. "The Multiple-Choice Knapsack Problem," Operations Research, INFORMS, vol. 27(3), pages 503-515, 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. Mathew, Tom V. & Khasnabis, Snehamay & Mishra, Sabyasachee, 2010. "Optimal resource allocation among transit agencies for fleet management," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(6), pages 418-432, July.
    2. Ngo, Huan Hoang & Shah, Rohan & Mishra, Sabyasachee, 2018. "Optimal asset management strategies for mixed transit fleet," Transportation Research Part A: Policy and Practice, Elsevier, vol. 117(C), pages 103-116.
    3. Zaarour, Nizar & Melachrinoudis, Emanuel & Solomon, Marius M., 2016. "Maximizing revenue of end of life items in retail stores," European Journal of Operational Research, Elsevier, vol. 255(1), pages 133-141.
    4. Mavrotas, G. & Diakoulaki, D. & Caloghirou, Y., 2006. "Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming," European Journal of Operational Research, Elsevier, vol. 171(1), pages 296-308, May.
    5. Xu, Chengcheng & Liu, Pan & Wang, Wei & Li, Zhibin, 2014. "Identification of freeway crash-prone traffic conditions for traffic flow at different levels of service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 69(C), pages 58-70.
    6. Junn-Yuan Teng & Wen-Chih Huang & Maw-Cherng Lin, 2010. "Systematic budget allocation for transportation construction projects: a case in Taiwan," Transportation, Springer, vol. 37(2), pages 331-361, March.
    7. Mavrotas, George & Diakoulaki, Danae & Kourentzis, Athanasios, 2008. "Selection among ranked projects under segmentation, policy and logical constraints," European Journal of Operational Research, Elsevier, vol. 187(1), pages 177-192, May.
    8. Yu, Ming-Miin & Chen, Li-Hsueh, 2016. "Centralized resource allocation with emission resistance in a two-stage production system: Evidence from a Taiwan’s container shipping company," Transportation Research Part A: Policy and Practice, Elsevier, vol. 94(C), pages 650-671.
    9. Mishra, Sabyasachee & Golias, Mihalis M. & Sharma, Sushant & Boyles, Stephen D., 2015. "Optimal funding allocation strategies for safety improvements on urban intersections," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 113-133.
    10. Sathaye, Nakul & Madanat, Samer, 2012. "A bottom-up optimal pavement resurfacing solution approach for large-scale networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 520-528.
    11. George Kozanidis, 2009. "Solving the linear multiple choice knapsack problem with two objectives: profit and equity," Computational Optimization and Applications, Springer, vol. 43(2), pages 261-294, June.
    12. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.

    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. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    2. Drexl, Andreas & Haase, Knut, 1996. "Fast approximation methods for sales force deployment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 411, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    4. Degraeve, Z. & Jans, R.F., 2003. "Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-026-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.
    5. George Kozanidis, 2009. "Solving the linear multiple choice knapsack problem with two objectives: profit and equity," Computational Optimization and Applications, Springer, vol. 43(2), pages 261-294, June.
    6. Andris A. Zoltners & Prabhakant Sinha, 2005. "The 2004 ISMS Practice Prize Winner—Sales Territory Design: Thirty Years of Modeling and Implementation," Marketing Science, INFORMS, vol. 24(3), pages 313-331, September.
    7. Yuji Nakagawa & Ross J. W. James & César Rego & Chanaka Edirisinghe, 2014. "Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models," Management Science, INFORMS, vol. 60(3), pages 695-707, March.
    8. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    9. Morton, Alec, 2014. "Aversion to health inequalities in healthcare prioritisation: A multicriteria optimisation perspective," Journal of Health Economics, Elsevier, vol. 36(C), pages 164-173.
    10. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    11. Bagchi, Ansuman & Bhattacharyya, Nalinaksha & Chakravarti, Nilotpal, 1996. "LP relaxation of the two dimensional knapsack problem with box and GUB constraints," European Journal of Operational Research, Elsevier, vol. 89(3), pages 609-617, March.
    12. Michael Stiglmayr & José Figueira & Kathrin Klamroth, 2014. "On the multicriteria allocation problem," Annals of Operations Research, Springer, vol. 222(1), pages 535-549, November.
    13. Wilbaut, Christophe & Todosijevic, Raca & Hanafi, Saïd & Fréville, Arnaud, 2023. "Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 304(3), pages 901-911.
    14. Edward Y H Lin & Chung-Min Wu, 2004. "The multiple-choice multi-period knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 187-197, February.
    15. Andonov, R. & Poirriez, V. & Rajopadhye, S., 2000. "Unbounded knapsack problem: Dynamic programming revisited," European Journal of Operational Research, Elsevier, vol. 123(2), pages 394-407, June.
    16. Dauzère-Pérès, Stéphane & Hassoun, Michael, 2020. "On the importance of variability when managing metrology capacity," European Journal of Operational Research, Elsevier, vol. 282(1), pages 267-276.
    17. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the multiple-choice nested knapsack problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 626, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Johnston, Robert E. & Khan, Lutfar R., 1995. "Bounds for nested knapsack problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 154-165, February.
    19. Isada, Yuriko & James, Ross J. W. & Nakagawa, Yuji, 2005. "An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint," European Journal of Operational Research, Elsevier, vol. 162(2), pages 503-513, April.
    20. Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.

    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:transa:v:36:y:2002:i:9:p:789-803. 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/wps/find/journaldescription.cws_home/547/description#description .

    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.