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

Two algorithms for maximizing a separable concave function over a polymatroid feasible region

Author

Listed:
  • Groenevelt, H.

Abstract

No abstract is available for this item.

Suggested Citation

  • Groenevelt, H., 1991. "Two algorithms for maximizing a separable concave function over a polymatroid feasible region," European Journal of Operational Research, Elsevier, vol. 54(2), pages 227-236, September.
    • Handle: RePEc:eee:ejores:v:54:y:1991:i:2:p:227-236
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(91)90300-K
    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.

    Citations

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


    Cited by:

    1. Jain, Kamal & Vazirani, Vijay V., 2010. "Eisenberg-Gale markets: Algorithms and game-theoretic properties," Games and Economic Behavior, Elsevier, vol. 70(1), pages 84-106, September.
    2. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    3. Flores-Szwagrzak, Karol, 2015. "Priority classes and weighted constrained equal awards rules for the claims problem," Journal of Economic Theory, Elsevier, vol. 160(C), pages 36-55.
    4. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.
    5. Li, X. & Zuidwijk, R.A. & de Koster, M.B.M. & Dekker, R., 2016. "Competitive Capacity Investment under Uncertainty," ERIM Report Series Research in Management ERS-2016-005-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.
    6. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    7. Karol Flores-Szwagrzak, 2017. "Efficient, fair, and strategy-proof (re)allocation under network constraints," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 109-131, January.
    8. Li, Xishu & Zuidwijk, Rob & de Koster, M.B.M, 2023. "Optimal competitive capacity strategies: Evidence from the container shipping market," Omega, Elsevier, vol. 115(C).
    9. Corinna Gottschalk & Hendrik Lüthen & Britta Peis & Andreas Wierz, 2018. "Optimization problems with color-induced budget constraints," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 861-870, October.
    10. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.
    11. S. Viswanathan, 2007. "An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem," Operations Research, INFORMS, vol. 55(5), pages 992-996, October.
    12. Zeyang Wu & Kameng Nip & Qie He, 2021. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1197-1212, July.

    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:54:y:1991:i:2:p:227-236. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.