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 条
  • [41] Exact and approximation algorithms for the loader problem
    Chen, Feng
    Tang, Guochun
    2006 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS (SOLI 2006), PROCEEDINGS, 2006, : 405 - +
  • [42] Approximation algorithms for the mixed postman problem
    Raghavachari, B
    Veerasamy, J
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 169 - 179
  • [43] Approximation algorithms for the test cover problem
    De Bontridder, KMJ
    Halldórsson, BV
    Halldórsson, MM
    Hurkens, CAJ
    Lenstra, JK
    Ravi, R
    Stougie, L
    MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) : 477 - 491
  • [44] Approximation Algorithms for the MAXSPACE Advertisement Problem
    Pedrosa, Lehilton L. C.
    da Silva, Mauro R. C.
    Schouery, Rafael C. S.
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (03) : 571 - 590
  • [45] Approximation algorithms for a genetic diagnostics problem
    Kosaraju, SR
    Schaffer, AA
    Biesecker, LG
    ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 69 - 92
  • [46] Approximation Algorithms for a Network Design Problem
    Bhattacharya, Binay
    Hu, Yuzhuang
    Shi, Qiaosheng
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 225 - 237
  • [47] Approximation algorithms for the airport and railway problem
    Salavatipour, Mohammad R.
    Tian, Lijiangnan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (01)
  • [48] Approximation algorithms for multiprocessor scheduling problem
    Fujita, Satoshi, 2000, IEICE of Japan, Tokyo, Japan (E83-D)
  • [49] Approximation Algorithms for the Multiorganization Scheduling Problem
    Dutot, Pierre-Francois
    Pascual, Fanny
    Rzadca, Krzysztof
    Trystram, Denis
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (11) : 1888 - 1895
  • [50] Approximation algorithms for the partial assignment problem
    Gao, Guichen
    Ning, Li
    Ting, Hing-Fung
    Xu, Yicheng
    Zhang, Yong
    Zou, Yifei
    THEORETICAL COMPUTER SCIENCE, 2020, 838 : 231 - 237
12345