Maximizing Classes of Two-Parameter Objectives Over Matroids

DOI10.1287/moor.14.2.362zbMath0668.05024OpenAlexW2095060915WikidataQ29012826 ScholiaQ29012826MaRDI QIDQ3820617

Arie Tamir, Refael Hassin

Publication date: 1989

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.14.2.362

zbMATH Keywords

spanning treepolynomial algorithmmatroidobjective

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (14)

A fifth bibliography of fractional programming^* ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ The multi-weighted spanning tree problem ⋮ Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Convex integer optimization by constantly many linear counterparts ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ Element perturbation problems of optimum spanning trees with two-parameter objectives ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ The submodular knapsack polytope ⋮ On minimal cost-reliability ratio spanning trees and related problems ⋮ Approximation algorithms for multi-parameter graph optimization problems

This page was built for publication: Maximizing Classes of Two-Parameter Objectives Over Matroids