The following pages link to (Q5684698):
Displayed 50 items.
- Super-modularity: Applications to convex games and to the greedy algorithm for LP (Q1161454) (← links)
- On matroid intersections (Q1166530) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
- Euclidean semi-matchings of random samples (Q1184341) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Paths on polymatroids (Q1196722) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- Dilworth truncations and \(k\)-induced matroids (Q1199486) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- Invertibility of the base Radon transform of a matroid (Q1201244) (← links)
- Extreme convex set functions with finite carrier: General theory (Q1212395) (← links)
- A good algorithm for edge-disjoint branching (Q1214942) (← links)
- Random matroids (Q1220516) (← links)
- The Euler circuit theorem for binary matroids (Q1223423) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- Bimatroids and invariants (Q1254324) (← links)
- Matroids on partially ordered sets (Q1271880) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- On the concavity of delivery games (Q1278793) (← links)
- Greedy sets and related problems (Q1278939) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- Discrete convex analysis (Q1290668) (← links)
- A necessary and sufficient condition for the convexity in oligopoly games (Q1296504) (← links)
- Independent branchings in acyclic digraphs (Q1297456) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- On fuzzification of matroids (Q1311845) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- Extreme convex set functions with many nonnegative differences (Q1343261) (← links)
- Equilibrium in a market of intellectual goods (Q1364441) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
- Minimum cut problem using bases of extended polymatroids (Q1385774) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- Improved bound for the Carathéodory rank of the bases of a matroid (Q1400967) (← links)
- The linear delta-matroid parity problem (Q1400971) (← links)
- Hamiltonian double Latin squares (Q1403912) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
- A greedy algorithm for convex geometries (Q1410695) (← links)
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)