scientific article; zbMATH DE number 1538871

From MaRDI portal
Publication:4519302

zbMATH Open0991.90111MaRDI QIDQ4519302

Govekar Manica

Publication date: 3 September 2002



Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (25)

Optimization strategies for two-mode partitioningSome constrained partitioning problems and majorizationTitle not available (Why is that?) ⋮ On generalized greedy splitting algorithms for multiway partition problemsOn some difficult linear programs coming from set partitioningPartition-Optimization with Schur Convex Sum Objective FunctionsWorst-case analysis of the differencing method for the partition problemPartitioning procedure for polynomial optimizationOptimal Set PartitioningEfficient computation of the overpartition function and applicationsTitle not available (Why is that?) ⋮ Approximation algorithms for the partial assignment problemTitle not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Optimization Methods for the Partner Units ProblemSolution of the generalized Neyman-Pearson problem using the methods for the optimal partitioning of setsTitle not available (Why is that?) ⋮ Approximation algorithms for array partitioning problemsPartitioning strategies for the block Cimmino algorithmSmoothed Analysis of Partitioning Algorithms for Euclidean FunctionalsA fixed parameter algorithm for optimal convex partitionsSimplex partitioning via exponential clocks and the multiway cut problemTitle not available (Why is that?) ⋮ A decision procedure for optimal polyhedron partitioningPARTITIONS-REQUIREMENTS-MATRICES AS OPTIMAL MARKOV KERNELS OF SPECIAL STOCHASTIC DYNAMIC DISTANCE OPTIMAL PARTITIONING PROBLEMS






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4519302)