A MIN-MAX RELATIONSHIP FOR THE EXACT MATROID PROBLEM

被引:0
|
作者
LECLERC, M
机构
关键词
D O I
10.1007/BF01200471
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:103 / 105
页数:3
相关论文
共 50 条
  • [2] Min-max partitioning problem with matroid constraint
    Wu, Biao
    Yao, En-yu
    [J]. JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2008, 9 (10): : 1446 - 1450
  • [3] Min-max partitioning problem with matroid constraint
    Biao Wu
    En-yu Yao
    [J]. Journal of Zhejiang University-SCIENCE A, 2008, 9 : 1446 - 1450
  • [4] A note on upgrading the min-max weight of a base of a matroid
    Hatajima, Yukiya
    Takazawa, Kenjiro
    [J]. JSIAM LETTERS, 2024, 16 : 1 - 4
  • [5] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
  • [6] Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem
    Furini, Fabio
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    [J]. INFORMS JOURNAL ON COMPUTING, 2015, 27 (02) : 392 - 405
  • [7] Heuristic and exact algorithms for a min-max selective vehicle routing problem
    Valle, Cristiano Arbex
    Martinez, Leonardo Conegundes
    da Cunha, Alexandre Salles
    Mateus, Geraldo R.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (07) : 1054 - 1065
  • [9] A MIN-MAX SOLUTION OF AN INVENTORY PROBLEM
    SCARF, H
    [J]. ECONOMETRICA, 1957, 25 (02) : 352 - 352
  • [10] Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
    Wu, Wei
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 : 98 - 110