Pages that link to "Item:Q4651462"

The following pages link to An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection (Q4651462):

Displayed 9 items.

• Implicit cover inequalities (Q266036) ‎ (← links)
• New approaches to multi-objective optimization (Q403670) ‎ (← links)
• Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) ‎ (← links)
• Evolutionary algorithms and matroid optimization problems (Q848644) ‎ (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) ‎ (← links)
• The subdivision-constrained minimum spanning tree problem (Q1006063) ‎ (← links)
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) ‎ (← links)
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) ‎ (← links)
• A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) ‎ (← links)