The following pages link to (Q5684698):
Displayed 50 items.
- On the number of common bases of two matroids (Q794657) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A note on matchings and separability (Q802467) (← links)
- An intersection theorem for supermatroids (Q803140) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Linear spaces, transversal polymatroids and ASL domains (Q857751) (← links)
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra (Q869913) (← links)
- Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- Complexity of tropical Schur polynomials (Q898243) (← links)
- Matchings and \(\Delta\)-matroids (Q920097) (← links)
- The structure of crossing separations in matroids (Q928774) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Independence-domination duality (Q958688) (← links)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions (Q967323) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Covering skew-supermodular functions by hypergraphs of minimum total size (Q1038104) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Decomposition of submodular functions (Q1053717) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
- Some combinatorial properties of discriminants in metric vector spaces (Q1086575) (← links)
- Activity optimization games with complementarity (Q1091957) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Greedoid polyhedra (Q1097283) (← links)
- On submodular function minimization (Q1104332) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Pseudomatroids (Q1109779) (← links)
- Convexity of integer veto and elimination procedures (Q1111437) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- A characterization of matroidal systems of inequalities (Q1118603) (← links)
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion (Q1119138) (← links)
- Combinatorial dynamical system theory: General framework and controllability criteria (Q1123170) (← links)
- The greedy algorithm for partially ordered sets (Q1140103) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- Discrete extremal problems (Q1152306) (← links)