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 条

[11] The ordered k-median problem: surrogate models and approximation algorithms
Aouad, Ali
Segev, Danny
MATHEMATICAL PROGRAMMING, 2019, 177 (1-2) : 55 - 83
[12] Approximation algorithms for the job interval selection problem and related scheduling problems
Chuzhoy, Julia
Ostrovsky, Rafail
Rabani, Yuval
MATHEMATICS OF OPERATIONS RESEARCH, 2006, 31 (04) : 730 - 738
[13] Approximation algorithms for the job interval selection problem and related scheduling problems
Chuzhoy, J
Ostrovsky, R
Rabani, Y
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 348 - 356
[14] On approximation of the fixed charge transportation problem
Adlakha, Veena
Kowalski, Krzysztof
Wang, Simi
Lev, Benjamin
Shen, Wenjing
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 43 : 64 - 70
[15] COST OPERATOR ALGORITHMS FOR TRANSPORTATION PROBLEM
SRINIVASAN, V
THOMPSON, GL
MATHEMATICAL PROGRAMMING, 1977, 12 (03) : 372 - 391
[16] ALGORITHMS FOR THE MINIMAX TRANSPORTATION PROBLEM.
Ahuja, R.K.
1600, (33):
[17] EFFICIENT ALGORITHMS FOR THE HITCHCOCK TRANSPORTATION PROBLEM
TOKUYAMA, T
NAKANO, J
SIAM JOURNAL ON COMPUTING, 1995, 24 (03) : 563 - 578
[18] Models, Algorithms and Approximation Results for a Bi-Level Synchronized Knapsack Problem
Bendali, Fatiha
Mailfert, Jean
Kamga, Eloise Mole
Quilliot, Alain
Toussaint, Helene
CYBERNETICS AND SYSTEMS, 2023,
[19] Dynamic Discrete Choice Models for Transportation
Cirillo, Cinzia
Xu, Renting
TRANSPORT REVIEWS, 2011, 31 (04) : 473 - 494
[20] On the choice of random directions for stochastic approximation algorithms
Theiler, J
Alper, J
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (03) : 476 - 481

← 1 2 3 4 5 →