Approximation algorithms for multi-index transportation problems with decomposable costs

DOI10.1016/S0166-218X(96)00128-XzbMath0883.90094OpenAlexW2136955469MaRDI QIDQ1363755

Frits C. R. Spieksma, Maurice Queyranne

Publication date: 4 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

worst-case behavioraxial multi-index transportation problem

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (10)

The approximability of three-dimensional assignment problems with bottleneck objective ⋮ Approximating the multi-level bottleneck assignment problem ⋮ \(N\)-fold integer programming ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ Solution of a multi-objective and multi-index real-life transportation problem using different fuzzy membership functions ⋮ Multi-index transport problems with decomposition structure ⋮ On multi-index assignment polytopes ⋮ Convex integer maximization via Graver bases ⋮ Graphs of transportation polytopes ⋮ The focus of attention problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• Multiple Alignment, Communication Cost, and Graph Matching
• Letter to the Editor—The Multidimensional Assignment Problem
• The Multi-Index Problem

This page was built for publication: Approximation algorithms for multi-index transportation problems with decomposable costs