Fast algorithms for the maximum convolution problem

DOI10.1016/0167-6377(94)90048-5zbMath0810.90146OpenAlexW2100020153MaRDI QIDQ1332943

Hannes Hassler, Michael R. Bussieck, Gerhard J. Woeginger, Uwe T. Zimmermann

Publication date: 10 October 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90048-5

zbMATH Keywords

probabilistic analysismaximum convolution problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Programming in abstract spaces (90C48) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items (4)

Inequalities for the gamma function with applications to permanents ⋮ A polyhedral perspective on tropical convolutions ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ Computational geometric aspects of rhythm, melody, and voice-leading

Uses Software

• Algorithm 97

Cites Work

• On the computational power of pushdown automata
• Generalized Selection and Ranking: Sorted Matrices
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms for the maximum convolution problem