Maximum marking problems
From MaRDI portal
Recommendations
- Theoretical Aspects of Computing – ICTAC 2005
- Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method
- scientific article; zbMATH DE number 512948
- Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
- On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note
This page was built for publication: Maximum marking problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757082)