Computing the sequence of \(k\)-cardinality assignments
From MaRDI portal
Publication:2165282
DOI10.1007/s10878-022-00889-4zbMath1493.90113arXiv2104.04037OpenAlexW3152628916MaRDI QIDQ2165282
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.04037
max-plus algebra\(k\)-cardinality assignment problemfull characteristic maxpolynomialparametric assignment algorithm
Integer programming (90C10) Determinants, permanents, traces, other special matrix functions (15A15) Max-plus and related algebras (15A80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Max-plus singular values
- The characteristic maxpolynomial of a matrix
- An algebra for piecewise-linear minimax problems
- Parametric shortest path algorithms with an application to cyclic staffing
- The \(k\)-cardinality assignment problem
- Solving the \(k\)-cardinality assignment problem by transformation
- Polynomial convolutions in max-plus algebra
- A fast parametric assignment algorithm with applications in max-algebra
- Algorithms for the Assignment and Transportation Problems
- Max-linear Systems: Theory and Algorithms
- Complexity of some parametric integer and network programming problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The QR Decomposition and the Singular Value Decomposition in the Symmetrized Max-Plus Algebra
- Fibonacci heaps and their uses in improved network optimization algorithms
- On some techniques useful for solution of transportation network problems
- Faster parametric shortest path and minimum‐balance algorithms
This page was built for publication: Computing the sequence of \(k\)-cardinality assignments
