Bottleneck extrema - MaRDI portal

Cited in

(only showing first 100 items - show all)

Linear and combinatorial sharing problems
Solution structures and sensitivity of special assignment problems
Polynomial-time algorithms for regular set-covering and threshold synthesis
Clutters and semimatroids
The complexity of ultrametric partitions on graphs
Minmax combinatorial optimization
Easy and hard bottleneck location problems
Discrete extremal problems
A simple approach to some basic results in matroid theory
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
Clutters and matroids
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
Application of optimization methods to the hematological support of patients with disseminated malignancies
Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales
An augmenting path method for solving linear bottleneck assignment problems
A general Hungarian method for the algebraic transportation problem
The matroids with the max-flow min-cut property
A two-commodity cut theorem
An augmenting path method for solving linear bottleneck transportation problems
On removing a vertex from the assignment polytope
An abstract duality
The -assignment problems
Order selection on a single machine with high set-up costs
A note on clutter partitions
Sign-central matrices
Four results about self-blocking clutters
Fault tolerant \(K\)-center problems
The disjunctive procedure and blocker duality
A three-person deterministic graphical game without Nash equilibria
Monotone bargaining is Nash-solvable
Clutters with \(\tau_ 2 \Relbar 2\tau\)
An analogue of Hoffman's circulation conditions for max-balanced flows
Reliability, covering and balanced matrices
Compositions for matroids with the Fulkerson property
A fast algorithm for a class of bottleneck problems
On \(k\)-sum optimization
Applying Lehman's theorems to packing problems
The dominance assignment problem
Linear inequalities for flags in graded partially ordered sets
Cuboids, a class of clutters
Simple games versus weighted voting games: bounding the critical threshold value
A new infinite class of ideal minimally non-packing clutters
Shortest path with acceleration constraints: complexity and approximation algorithms
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
Testing idealness in the filter oracle model
Idealness of \(k\)-wise intersecting families
Intersecting and dense restrictions of clutters in polynomial time
Which graphs occur as \(\gamma\)-graphs?
Tropical Kirchhoff's formula and postoptimality in matroid optimization
A combinatorial approach to nonlocality and contextuality
On effectivity functions of game forms
An efficient heuristic algorithm for the bottleneck traveling salesman problem
Decomposing 1-Sperner hypergraphs
Structure of cubic Lehman matrices
The quadratic balanced optimization problem
An improved algorithm for two stage time minimization assignment problem
HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
Deltas, extended odd holes and their blockers
On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
Some insight into characterizations of minimally nonideal matrices
Clutter nonidealness
On a certain class of nonideal clutters
On the composition and decomposition of clutters
Anti-blocking polyhedra
The equipartition polytope. I: Formulations, dimension and basic facets
Intersecting restrictions in clutters
Clean tangled clutters, simplices, and projective geometries
Tropical Carathéodory with matroids
New approximation results for resource replication problems
Single commodity-flow algorithms for lifts of graphic and cographic matroids
Fairness in academic course timetabling
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Delta minors, delta free clutters, and entanglement
Two algorithms for determining a minimum independent dominating set
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
Representation of the non-dominated set in biobjective discrete optimization
Lehman's theorem and the directed Steiner tree problem
On Acyclicity of Games with Cycles
Finding the set of alternatives in discrete multicriterion problems
Structural questions with GERT-networks
Solution of combinatorial optimization problems with minimax criterion
The travelling salesman problem and a class of polyhedra of diameter two
Einige Aspekte in der Zuordnungstheorie
Bottleneck linear programming
Flow symmetry and algebraic flows
Fractional packing in ideal clutters
Generalized multiple objective bottleneck problems
On ideal clutters, metrics and multiflows
On incomparable collections of sets
An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
The fault-tolerant capacitated \(K\)-center problem
Generalized Bottleneck Problems^∗
Generalized chessboard complexes and discrete Morse theory
scientific article; zbMATH DE number 7348694 (Why is no real title available?)
Resistant sets in the unit hypercube
Idealness of k-wise intersecting families
Clean clutters and dyadic fractional packings
On combinatorial properties of binary spaces
Experimental analysis of heuristics for the bottleneck traveling salesman problem

This page was built for publication: Bottleneck extrema

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5622201)