Approximation algorithms for the transportation problem with market choice and related models

被引：5
|
作者：
Aardal, Karen [1 ,2 ]
Le Bodic, Pierre [3 ]
机构：
[1] Delft Univ Technol, Delft Inst Appl Math, Delft, Netherlands
[2] Ctr Wiskunde & Informat, Amsterdam, Netherlands
[3] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
来源：
OPERATIONS RESEARCH LETTERS | 2014年 / 42卷 / 08期
基金：
美国国家科学基金会;
关键词：
Approximation algorithms; Transportation problem with market choice; Capacitated facility location; FACILITY LOCATION PROBLEM; CAPACITIES;
D O I：
10.1016/j.orl.2014.09.008
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. We give polynomial-time reductions from this problem and variants to the (un)capacitated facility location problem, directly yielding approximation algorithms, two with constant factors in the metric case, one with a logarithmic factor in the general case. Published by Elsevier B.V.
引用
收藏
页码：549 / 552
页数：4
相关论文
共 50 条
  • [21] Multiple Choice Knapsack Problem: Example of planning choice in transportation
    Zhong, Tao
    Young, Rhonda
    EVALUATION AND PROGRAM PLANNING, 2010, 33 (02) : 128 - 137
  • [22] Complexity and Approximation Results on the Shared Transportation Problem
    Davot, Tom
    Giroudeau, Rodolphe
    Konig, Jean-Claude
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 140 - 151
  • [23] On approximation algorithms for the minimum satisfiability problem
    Marathe, MV
    Ravi, SS
    INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 23 - 29
  • [24] Approximation algorithms for the bus evacuation problem
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (01) : 131 - 141
  • [25] Approximation Algorithms for the Class Cover Problem
    Adam H. Cannon
    Lenore J. Cowen
    Annals of Mathematics and Artificial Intelligence, 2004, 40 : 215 - 223
  • [26] ON APPROXIMATION ALGORITHMS FOR STEINER PROBLEM IN GRAPHS
    WIDMAYER, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 17 - 28
  • [27] Approximation Algorithms for the Capacitated Domination Problem
    Kao, Mong-Jen
    Chen, Han-Lin
    FRONTIERS IN ALGORITHMICS, 2010, 6213 : 185 - 196
  • [28] Approximation algorithms for a genetic diagnostics problem
    Kosaraju, SR
    Schaffer, AA
    Biesecker, LG
    JOURNAL OF COMPUTATIONAL BIOLOGY, 1998, 5 (01) : 9 - 26
  • [29] Approximation algorithms for the unsplittable flow problem
    Chakrabarti, A
    Chekuri, C
    Gupta, A
    Kumar, A
    APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 51 - 66
  • [30] Approximation algorithms for the class cover problem
    Cannon, AH
    Cowen, LJ
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2004, 40 (3-4) : 215 - 223
12345