A MULTIPLY CONSTRAINED MATROID OPTIMIZATION PROBLEM

被引：1
|
作者：
RENDL, F [1 ]
LECLERC, M [1 ]
机构：
[1] UNIV COLOGNE,INST MATH,D-5000 COLOGNE 41,FED REP GER
来源：
DISCRETE MATHEMATICS | 1989年 / 73卷 / 1-2期
关键词：
D O I：
10.1016/0012-365X(88)90149-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：207 / 212
页数：6
相关论文
共 50 条
  • [1] Matroid Constrained Fair Allocation Problem
    Biswas, Arpita
    Barman, Siddharth
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 9921 - 9922
  • [2] The Distance-Constrained Matroid Median Problem
    Naoyuki Kamiyama
    Algorithmica, 2020, 82 : 2087 - 2106
  • [3] The Distance-Constrained Matroid Median Problem
    Kamiyama, Naoyuki
    ALGORITHMICA, 2020, 82 (07) : 2087 - 2106
  • [4] Approximation Algorithms for the Multiply Constrained Assignment Problem
    Yokoya, Daisuke
    Yamada, Takeo
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 152 - 159
  • [5] The Cognitive Underpinnings of Multiply-Constrained Problem Solving
    Ellis, Derek M.
    Robison, Matthew K.
    Brewer, Gene A.
    JOURNAL OF INTELLIGENCE, 2021, 9 (01) : 1 - 25
  • [6] Inverse matroid optimization problem under Chebyshev distance
    Tayyebi, Javad
    Bigdeli, Hamid
    2021 52ND ANNUAL IRANIAN MATHEMATICS CONFERENCE (AIMC), 2021, : 59 - 61
  • [7] Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression
    Thiery, Theophile
    Ward, Justin
    CONFERENCE ON LEARNING THEORY, VOL 178, 2022, 178
  • [8] On the Cardinality Constrained Matroid Polytope
    Maurras, Jean Francois
    Stephan, Ruediger
    NETWORKS, 2011, 57 (03) : 240 - 246
  • [9] A CONSTRAINED MATRIX OPTIMIZATION PROBLEM
    WOLKOWICZ, H
    SIAM REVIEW, 1982, 24 (01) : 83 - 83
  • [10] The phase problem: A problem in constrained global optimization
    Hauptman, HA
    DIRECT METHODS FOR SOLVING MACROMOLECULAR STRUCTURES, 1998, 507 : 381 - 388
12345