Random pseudo-polynomial algorithms for some combinatorial programming problems
type: Item
instance of: scholarly article
title: Random pseudo-polynomial algorithms for some combinatorial programming problems
zbMATH Open document ID: 0757.90066
DOI: 10.1016/0377-2217(92)90209-R
published in: European Journal of Operational Research
publication date: 1992-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 68474
zbMATH Keywords: survey
zbMATH Keywords: random pseudo-polynomial algorithms
zbMATH Keywords: weighted combinatorial problems
author: Giulia Galbiati
author: Francesco Maffioli
MaRDI profile type: Publication
cites work: Q4773298
cites work: On the computation of pfaffians
cites work: Exact arborescences, matchings and cycles
cites work: Random pseudo-polynomial algorithms for exact matroid problems
cites work: The image of weighted combinatorial problems
cites work: Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
cites work: Systems of distinct representatives and linear algebra
cites work: Q5588717
cites work: Q4130999
cites work: Q3891767
cites work: Matching theory
cites work: Randomized algorithms in combinatorial optimization: A survey
cites work: Q3703583
cites work: Matching is as easy as matrix inversion
cites work: Q4739657
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
description: scientific article; zbMATH DE number 68474