The following pages link to (Q5684698):
Displaying 50 items.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- Packing Steiner trees (Q273179) (← links)
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
- Remarkable polyhedra related to set functions, games and capacities (Q301379) (← links)
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems (Q335907) (← links)
- Looking for edge-equitable spanning trees (Q336753) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Embedding rectilinear Steiner trees with length restrictions (Q344768) (← links)
- Antistrong digraphs (Q345072) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- Axioms for infinite matroids (Q390757) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Immersing complete digraphs (Q427820) (← links)
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- Is submodularity testable? (Q472463) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Stiefel tropical linear spaces (Q491984) (← links)
- A novel probabilistic formulation for locating and sizing emergency medical service stations (Q492857) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- On cardinality constrained polymatroids (Q496667) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Theta rank, levelness, and matroid minors (Q505908) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- On set functions that can be extended to convex functionals (Q556877) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- A convex representation of totally balanced games (Q655519) (← links)
- On Minkowski sums of simplices (Q659803) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Bases-cobases graphs and polytopes of matroids (Q684402) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- \(K\)-classes for matroids and equivariant localization (Q691564) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- A vector exchange property of submodular systems (Q760438) (← links)
- Polyhedra with the integer Carathéodory property (Q765190) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- On the number of common bases of two matroids (Q794657) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
