The transportation problem with conflicts
From MaRDI portal
Publication:829180
DOI10.1007/s10479-018-3004-yzbMath1462.90017OpenAlexW2888318385WikidataQ129353235 ScholiaQ129353235MaRDI QIDQ829180
Frits C. R. Spieksma, Gerhard J. Woeginger, Annette M. C. Ficker
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/594801
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ One transfer per patient suffices: structural insights about patient-to-room assignment ⋮ Resource time-sharing for IoT applications with deadlines ⋮ Structural insights about avoiding transfers in the patient-to-room assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- The Red-Blue transportation problem
- The maximum flow problem with disjunctive constraints
- Paths, trees and matchings under disjunctive constraints
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The transportation problem with exclusionary side constraints
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- On sum coloring of graphs
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Solving transportation problems with nonlinear side constraints with tabu search
- Between a rock and a hard place: the two-to-one assignment problem
- Packing items into several bins facilitates approximating the separable assignment problem
- A short proof of the NP-completeness of minimum sum interval coloring
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- Maximum Weighted Independent Sets with a Budget
- Transportation problem with nonlinear side constraints a branch and bound approach
- Minimum Color Sum of Bipartite Graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
This page was built for publication: The transportation problem with conflicts