IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i3d10.1007_s10878-017-0182-5.html
   My bibliography  Save this article

Optimization problems with color-induced budget constraints

Author

Listed:
  • Corinna Gottschalk

    (RWTH Aachen University
    Siemens Corporate Technology)

  • Hendrik Lüthen

    (TU Darmstadt)

  • Britta Peis

    (RWTH Aachen University)

  • Andreas Wierz

    (RWTH Aachen University)

Abstract

In 1984, Gabow and Tarjan provided a very elegant and fast algorithm for the following problem: given a matroid defined on a red and blue colored ground set, determine a basis of minimum cost among those with k red elements, or decide that no such basis exists. In this paper, we investigate extensions of this problem from ordinary matroids to the more general notion of poset matroids which take precedence constraints on the ground set into account. We show that the problem on general poset matroids becomes -hard, already if the underlying partially ordered set (poset) consists of binary trees of height two. On the positive side, we present two algorithms: a pseudopolynomial one for integer polymatroids, i.e., the case where the poset consists of disjoint chains, and a polynomial algorithm for the problem to determine a minimum cost ideal of size l with k red elements, i.e., the uniform rank-l poset matroid, on series-parallel posets.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-017-0182-5
    DOI: 10.1007/s10878-017-0182-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0182-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0182-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Ulrich Faigle & Walter Kern, 1994. "Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints," Operations Research, INFORMS, vol. 42(4), pages 688-693, August.
    2. 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.
    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. 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.
    2. 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.
    3. 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.
    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, Xishu & Zuidwijk, Rob & de Koster, M.B.M, 2023. "Optimal competitive capacity strategies: Evidence from the container shipping market," Omega, Elsevier, vol. 115(C).
    6. Montiel, Luis & Dimitrakopoulos, Roussos, 2015. "Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 166-178.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
    12. 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.
    13. 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.

    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:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-017-0182-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.