Bottleneck extrema
From MaRDI portal
Publication:5622201
DOI10.1016/S0021-9800(70)80083-7zbMath0218.05006OpenAlexW4205775998WikidataQ56430228 ScholiaQ56430228MaRDI QIDQ5622201
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80083-7
Related Items
The disjunctive procedure and blocker duality ⋮ New approximation results for resource replication problems ⋮ Linear and combinatorial sharing problems ⋮ A note on clutter partitions ⋮ Fairness in academic course timetabling ⋮ Sign-central matrices ⋮ Solution structures and sensitivity of special assignment problems ⋮ A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph ⋮ Polynomial-time algorithms for regular set-covering and threshold synthesis ⋮ Matroid and knapsack center problems ⋮ Reliability, covering and balanced matrices ⋮ Clutters and semimatroids ⋮ The complexity of ultrametric partitions on graphs ⋮ The equipartition polytope. I: Formulations, dimension and basic facets ⋮ Compositions for matroids with the Fulkerson property ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Intersecting and dense restrictions of clutters in polynomial time ⋮ Intersecting restrictions in clutters ⋮ A fast algorithm for a class of bottleneck problems ⋮ Four results about self-blocking clutters ⋮ On \(k\)-sum optimization ⋮ Applying Lehman's theorems to packing problems ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ Minmax combinatorial optimization ⋮ The dominance assignment problem ⋮ Easy and hard bottleneck location problems ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ Tropical Carathéodory with matroids ⋮ HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) ⋮ Deltas, extended odd holes and their blockers ⋮ Which graphs occur as \(\gamma\)-graphs? ⋮ On generalized balanced optimization problems ⋮ 1-factor covers of regular graphs ⋮ Discrete extremal problems ⋮ Fractional packing in ideal clutters ⋮ Facet defining inequalities for the dichotomous knapsack problem ⋮ (1,k)-configuration facets for the generalized assignment problem ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ A simple approach to some basic results in matroid theory ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Generalized multiple objective bottleneck problems ⋮ Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets ⋮ On the solution of discrete bottleneck problems ⋮ Tropical Kirchhoff's formula and postoptimality in matroid optimization ⋮ Linear inequalities for flags in graded partially ordered sets ⋮ Clutters and matroids ⋮ The fault-tolerant capacitated \(K\)-center problem ⋮ Clutters and circuits ⋮ Cuboids, a class of clutters ⋮ Stability of two player game structures ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ A unified interpretation of several combinatorial dualities ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ Combinatorial characterization of read-once formulae ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs ⋮ Monotone clutters ⋮ Transformation and decomposition of clutters into matroids ⋮ Some insight into characterizations of minimally nonideal matrices ⋮ Acyclic, or totally tight, two-person game forms: characterization and main properties ⋮ The Helly property and satisfiability of Boolean formulas defined on set families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Selected topics on assignment problems ⋮ Ideal clutters ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Clutter nonidealness ⋮ Application of optimization methods to the hematological support of patients with disseminated malignancies ⋮ On acyclicity of games with cycles ⋮ On effectivity functions of game forms ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales ⋮ On a certain class of nonideal clutters ⋮ The nonidealness index of rank-ideal matrices ⋮ The set coincidence game: Complexity, attainability, and symmetric strategies ⋮ An augmenting path method for solving linear bottleneck assignment problems ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ A general Hungarian method for the algebraic transportation problem ⋮ The matroids with the max-flow min-cut property ⋮ The \(k\)-centrum shortest path problem ⋮ A two-commodity cut theorem ⋮ Monotone bargaining is Nash-solvable ⋮ An augmenting path method for solving linear bottleneck transportation problems ⋮ Clutters with \(\tau_ 2 \Relbar 2\tau\) ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ On removing a vertex from the assignment polytope ⋮ An abstract duality ⋮ On the composition and decomposition of clutters ⋮ Decomposing 1-Sperner hypergraphs ⋮ Anti-blocking polyhedra ⋮ Fault tolerant \(K\)-center problems ⋮ Structure of cubic Lehman matrices ⋮ The \(\beta\)-assignment problems ⋮ Shortest path with acceleration constraints: complexity and approximation algorithms ⋮ The quadratic balanced optimization problem ⋮ Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making ⋮ Order selection on a single machine with high set-up costs ⋮ Testing idealness in the filter oracle model ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Idealness of \(k\)-wise intersecting families ⋮ Idealness of k-wise Intersecting Families ⋮ Generalized chessboard complexes and discrete Morse theory ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems ⋮ Flow symmetry and algebraic flows ⋮ Lehman's Theorem and the Directed Steiner Tree Problem ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Solution of combinatorial optimization problems with minimax criterion ⋮ Unnamed Item ⋮ Approximation and decomposition in lattices of clutters ⋮ On combinatorial properties of binary spaces ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ Generalized Bottleneck Problems∗ ⋮ Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Blocking and anti-blocking pairs of polyhedra ⋮ The travelling salesman problem and a class of polyhedra of diameter two ⋮ Quadratic bottleneck problems ⋮ Einige Aspekte in der Zuordnungstheorie ⋮ Finding the set of alternatives in discrete multicriterion problems ⋮ On ideal clutters, metrics and multiflows ⋮ Two algorithms for determining a minimum independent dominating set ⋮ Bottleneck linear programming ⋮ A class of bottleneck expansion problems ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Opposite Elements in Clutters ⋮ Ideal Clutters That Do Not Pack ⋮ Unnamed Item ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids ⋮ Structural questions with GERT-networks ⋮ On Acyclicity of Games with Cycles ⋮ Resistant Sets in the Unit Hypercube ⋮ On incomparable collections of sets
