IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/8b2e0185-36f9-43df-8a3d-d1bb7c117c9f.html
   My bibliography  Save this paper

A Partial Ranking Algorithm for Resource Allocation Problems

Author

Listed:
  • De Waegenaere, A.M.B.

    (Tilburg University, Center For Economic Research)

  • Wielhouwer, J.L.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Discussion Paper 2001-40, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:8b2e0185-36f9-43df-8a3d-d1bb7c117c9f
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/538952/40.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Muralidharan S. Kodialam & Hanan Luss, 1998. "Algorithms for Separable Nonlinear Resource Allocation Problems," Operations Research, INFORMS, vol. 46(2), pages 272-284, April.
    2. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "Optimal Tax Depreciation Lives and Charges under Regulatory Constraints," Discussion Paper 2001-23, Tilburg University, Center for Economic Research.
    3. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "Optimal Tax Depreciation Lives and Charges under Regulatory Constraints," Other publications TiSEM 8f50ceb2-630a-439c-be28-7, Tilburg University, School of Economics and Management.
    4. Kurt M. Bretthauer & Bala Shetty, 1995. "The Nonlinear Resource Allocation Problem," Operations Research, INFORMS, vol. 43(4), pages 670-683, August.
    5. Gabriel R. Bitran & Arnoldo C. Hax, 1981. "Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables," Management Science, INFORMS, vol. 27(4), pages 431-441, April.
    6. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    7. Soren S. Nielsen & Stavros A. Zenios, 1993. "A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems," Operations Research, INFORMS, vol. 41(2), pages 319-337, April.
    Full references (including those not matched with items on IDEAS)

    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. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Other publications TiSEM 8b2e0185-36f9-43df-8a3d-d, Tilburg University, School of Economics and Management.
    2. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    3. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    4. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    5. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    6. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    7. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    8. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
    9. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    10. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    11. Lee, Zu-Hsu & Deng, Shiming & Lin, Beixin & Yang, James G.S., 2010. "Decision model and analysis for investment interest expense deduction and allocation," European Journal of Operational Research, Elsevier, vol. 200(1), pages 268-280, January.
    12. Kurt M. Bretthauer & Bala Shetty & Siddhartha Syam, 2003. "A specially structured nonlinear integer resource allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 770-792, October.
    13. Bretthauer, Kurt M. & Ross, Anthony & Shetty, Bala, 1999. "Nonlinear integer programming for optimal allocation in stratified sampling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 667-680, August.
    14. Li, Linda & Firouz, Mohammad & Ahmed, Abdulaziz & Delen, Dursun, 2023. "On the Egalitarian–Utilitarian spectrum in stochastic capacitated resource allocation problems," International Journal of Production Economics, Elsevier, vol. 262(C).
    15. Chernonog, Tatyana & Goldberg, Noam, 2018. "On the multi-product newsvendor with bounded demand distributions," International Journal of Production Economics, Elsevier, vol. 203(C), pages 38-47.
    16. 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.
    17. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
    18. Awi Federgruen & C. Daniel Guetta & Garud Iyengar, 2018. "Two‐echelon distribution systems with random demands and storage constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 594-618, December.
    19. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    20. Chi To Ng & Mikhail Yakovlevich Kovalyov & Tai Chiu Edwin Cheng, 2008. "An FPTAS for a supply scheduling problem with non‐monotone cost functions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 194-199, April.

    More about this item

    Keywords

    Programming; non-linear;

    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:tiu:tiucen:8b2e0185-36f9-43df-8a3d-d1bb7c117c9f. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.