The following pages link to (Q2718910):
Displaying 50 items.
- Looking for edge-equitable spanning trees (Q336753) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- Covering cycle matroid (Q469837) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- Shunting minimal rail car allocation (Q812422) (← links)
- Nullity-based matroid of rough sets and its application to attribute reduction (Q903646) (← links)
- Solving k-shortest and constrained shortest path problems efficiently (Q918435) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Random matroids (Q1220516) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- Algorithms for synthesizing mechanical systems with maximal natural frequencies (Q1926188) (← links)
- Geometric lattice structure of covering-based rough sets through matroids (Q1952797) (← links)
- The order properties and Karcher barycenters of probability measures on the open convex cone (Q1990368) (← links)
- Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
- Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories (Q2022735) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
- Managing risk-adjusted resource allocation for project time-cost tradeoffs (Q2095230) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
- Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- The electric vehicle shortest-walk problem with battery exchanges (Q2357868) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems (Q2800805) (← links)
- Efficient algorithms for a simple network design problem (Q2811297) (← links)
- Covers of Query Results (Q3305362) (← links)
- Approximating the Stochastic Network by its <i>M</i> Shortest Paths (Q3415944) (← links)
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem (Q5056912) (← links)
- Recognizing even-cycle and even-cut matroids (Q6052071) (← links)
- On polynomially solvable constrained input selections for fixed and switched linear structured systems (Q6088368) (← links)
- Time–cost trade-off in a multi-choice assignment problem (Q6094492) (← links)
