The transportation problem with conflicts
type: Item
instance of: scholarly article
title: The transportation problem with conflicts
zbMATH Open document ID: 1462.90017
author: Annette M. C. Ficker
author: Frits C. R. Spieksma
author: Gerhard J. Woeginger
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/594801
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 7344544
zbMATH Keywords: transportation problem
zbMATH Keywords: conflict graph
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation
MaRDI profile type: Publication
OpenAlex ID: W2888318385
cites work: Q3056948
cites work: Minimum Color Sum of Bipartite Graphs
cites work: Packing items into several bins facilitates approximating the separable assignment problem
cites work: Transportation problem with nonlinear side constraints a branch and bound approach
cites work: Solving transportation problems with nonlinear side constraints with tabu search
cites work: Paths, trees and matchings under disjunctive constraints
cites work: Tight approximation algorithms for maximum separable assignment problems
cites work: Q4198056
cites work: Between a rock and a hard place: the two-to-one assignment problem
cites work: The transportation problem with exclusionary side constraints
cites work: Maximum Weighted Independent Sets with a Budget
cites work: A short proof of the NP-completeness of minimum sum interval coloring
cites work: The maximum flow problem with disjunctive constraints
cites work: The \((n^ 2-1)\)-puzzle and related relocation problems
cites work: On sum coloring of graphs
cites work: A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
cites work: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
cites work: Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
cites work: The Red-Blue transportation problem
Wikidata QID: Q129353235
DOI: 10.1007/S10479-018-3004-Y
Recommended article: On Solving the Transportation Problem
Recommended article: Q4324518
Recommended article: Q4664818
Recommended article: Q5285969
Recommended article: Some aspects on solving transportation problem
Recommended article: Q3318538
Recommended article: A survey of transportation problems
Recommended article: Q4937993
Recommended article: Competitive transportation problems
description: scientific article; zbMATH DE number 7344544