Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems
DOI10.12732/IJPAM.V88I2.4zbMATH Open1302.90242OpenAlexW2055976416MaRDI QIDQ2867715
Publication date: 20 December 2013
Published in: International Journal of Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.ijpam.eu/contents/2013-88-2/4/index.html
combinatoricstransportproductionMarkov decision processpartitions-requirements-matricesstochastic dynamic distance optimal partitioning problem
Transportation, logistics and supply chain management (90B06) Production models (90B30) Markov and semi-Markov decision processes (90C40) Enumerative combinatorics (05A99) Matrices of integers (15B36) Stochastic matrices (15B51)
Recommendations
- Extensions of the optimal partition problem for a measure space 👍 👎
- A multivariate partition approach to optimization problems 👍 👎
- Estimates of the duality gap for optimum partition problems 👍 👎
- Probabilistic analysis of optimum partitioning 👍 👎
- Stochastic analysis of partitioning algorithms for matching problems 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867715)
