Pages that link to "Item:Q3335803"

The following pages link to Efficient algorithms for a family of matroid intersection problems (Q3335803):

Displaying 41 items.

• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• Generalized multiple objective bottleneck problems (Q453049) (← links)
• On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
• Semi-preemptive routing on a linear and circular track (Q834179) (← links)
• Probabilistic single processor scheduling (Q912611) (← links)
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
• The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
• Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem) (Q1084400) (← links)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
• An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
• On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
• Exact arborescences, matchings and cycles (Q1095157) (← links)
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
• A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788) (← links)
• Color constrained combinatorial optimization problems (Q1178732) (← links)
• Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
• Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint (Q1286282) (← links)
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
• The vertex degrees of minimum spanning trees (Q1580975) (← links)
• Optimization problems with color-induced budget constraints (Q1631646) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• A multiply constrained matroid optimization problem (Q1825757) (← links)
• A data structure for dynamic trees (Q1838310) (← links)
• Matroid optimization with generalized constraints (Q1902899) (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
• Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems (Q1926654) (← links)
• Efficient solution of the matroid product problem (Q2314409) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Optimization Problems with Color-Induced Budget Constraints (Q2835676) (← links)
• Semi–preemptive routing on a line (Q3439160) (← links)
• A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
• Small degree out‐branchings (Q4805223) (← links)
• Bicolored matchings in some classes of graphs (Q5899324) (← links)
• Multi-objective matroid optimization with ordinal weights (Q6046136) (← links)
• Min‐sum controllable risk problems with concave risk functions of the same value range (Q6065855) (← links)
• An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem (Q6123387) (← links)
• An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)