Pages that link to "Item:Q3820617"

The following pages link to Maximizing Classes of Two-Parameter Objectives Over Matroids (Q3820617):

Displaying 22 items.

• Two classes of optimal two-dimensional OOCs (Q411483) (← links)
• Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
• Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
• Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
• An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
• A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
• Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
• Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
• Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
• On minimal cost-reliability ratio spanning trees and related problems (Q2564303) (← links)
• On matroids with multiple objectives (Q2785392) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• A fifth bibliography of fractional programming^* (Q4265528) (← links)
• Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
• Multi-objective matroid optimization with ordinal weights (Q6046136) (← links)
• The multi-weighted spanning tree problem (Q6085702) (← links)
• A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)