The following pages link to Bottleneck extrema (Q5622201):
Displayed 50 items.
- The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
- Clutters and circuits (Q675907) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Monotone clutters (Q688257) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Ideal clutters (Q697573) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- (1,k)-configuration facets for the generalized assignment problem (Q914550) (← links)
- Stability of two player game structures (Q948685) (← links)
- A unified interpretation of several combinatorial dualities (Q951109) (← links)
- The \(k\)-centrum shortest path problem (Q997931) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- Solution structures and sensitivity of special assignment problems (Q1086156) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- Clutters and semimatroids (Q1095913) (← links)
- The complexity of ultrametric partitions on graphs (Q1098632) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Easy and hard bottleneck location problems (Q1135201) (← links)
- Discrete extremal problems (Q1152306) (← links)
- A simple approach to some basic results in matroid theory (Q1161524) (← links)
- Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets (Q1166415) (← links)
- On the solution of discrete bottleneck problems (Q1167061) (← links)
- Clutters and matroids (Q1176744) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales (Q1223328) (← links)
- An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
- A general Hungarian method for the algebraic transportation problem (Q1245143) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- A two-commodity cut theorem (Q1250228) (← links)
- An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
- On removing a vertex from the assignment polytope (Q1260145) (← links)
- An abstract duality (Q1262319) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- A note on clutter partitions (Q1332941) (← links)
- Sign-central matrices (Q1336413) (← links)
- Four results about self-blocking clutters (Q1377860) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- The disjunctive procedure and blocker duality (Q1613383) (← links)
- Clutters with \(\tau_ 2 \Relbar 2\tau\) (Q1801694) (← links)
- An analogue of Hoffman's circulation conditions for max-balanced flows (Q1802959) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Compositions for matroids with the Fulkerson property (Q1900139) (← links)
- A fast algorithm for a class of bottleneck problems (Q1916054) (← links)
- On \(k\)-sum optimization (Q1919195) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Linear inequalities for flags in graded partially ordered sets (Q1971014) (← links)
- Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)