The following pages link to Bottleneck extrema (Q5622201):
Displaying 49 items.
- New approximation results for resource replication problems (Q270001) (← links)
- Fairness in academic course timetabling (Q284412) (← 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)
- 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)
- On acyclicity of games with cycles (Q708338) (← 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)
- A three-person deterministic graphical game without Nash equilibria (Q1752440) (← links)
- Monotone bargaining is Nash-solvable (Q1801037) (← links)
- The dominance assignment problem (Q1926493) (← links)
- Linear inequalities for flags in graded partially ordered sets (Q1971014) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- A new infinite class of ideal minimally non-packing clutters (Q2032738) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- Tropical Kirchhoff's formula and postoptimality in matroid optimization (Q2217458) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- An improved algorithm for two stage time minimization assignment problem (Q2420663) (← links)
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) (Q2421517) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)
- Clutter nonidealness (Q2492208) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- Clean tangled clutters, simplices, and projective geometries (Q2668014) (← links)
- Tropical Carathéodory with matroids (Q2679600) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
