The following pages link to Bottleneck extrema (Q5622201):
Displayed 50 items.
- New approximation results for resource replication problems (Q270001) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- Fractional packing in ideal clutters (Q431029) (← links)
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Transformation and decomposition of clutters into matroids (Q526353) (← links)
- The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- 1-factor covers of regular graphs (Q628309) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← 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)
- On acyclicity of games with cycles (Q708338) (← 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)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← 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)