Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems
type: Item
instance of: scholarly article
zbMATH Open document ID: 1302.90242
author: R. Hildenbrandt
publication date: 2013-12-20T00:00:00Z
full work available at URL: index.html
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 05A99
Mathematics Subject Classification ID: 15B51
Mathematics Subject Classification ID: 15B36
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6241491
zbMATH Keywords: Markov decision process
zbMATH Keywords: combinatorics
zbMATH Keywords: stochastic dynamic distance optimal partitioning problem
zbMATH Keywords: partitions-requirements-matrices
zbMATH Keywords: production
zbMATH Keywords: transport
MaRDI profile type: Publication
OpenAlex ID: W2055976416
DOI: 10.12732/IJPAM.V88I2.4
Recommended article: Stochastic analysis of partitioning algorithms for matching problems
Recommended article: Q4519302
Recommended article: Q4880412
Recommended article: A multivariate partition approach to optimization problems
Recommended article: Extensions of the optimal partition problem for a measure space
Recommended article: Q4459637
Recommended article: Q4225519
Recommended article: Probabilistic analysis of optimum partitioning
Recommended article: Estimates of the duality gap for optimum partition problems
title: Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems
published in: International Journal of Pure and Applied Mathematics
description: scientific article; zbMATH DE number 6241491