Bottleneck extrema - MaRDI portal

Cited In (only showing first 100 items - show all)

Ideal Clutters That Do Not Pack
Clutters and circuits
(1,k)-configuration facets for the generalized assignment problem
Linear inequalities for flags in graded partially ordered sets
Monotone clutters
1-factor covers of regular graphs
The equipartition polytope. I: Formulations, dimension and basic facets
On effectivity functions of game forms
Clutters and semimatroids
New approximation results for resource replication problems
Clutters and matroids
On Acyclicity of Games with Cycles
Nash-solvable two-person symmetric cycle game forms
Selected topics on assignment problems
On acyclicity of games with cycles
Fairness in academic course timetabling
Quadratic bottleneck problems
Acyclic, or totally tight, two-person game forms: characterization and main properties
A two-commodity cut theorem
Bibliography on domination in graphs and some basic definitions of domination parameters
Blocking and anti-blocking pairs of polyhedra
Generalized chessboard complexes and discrete Morse theory
Finding the set of alternatives in discrete multicriterion problems
A simple approach to some basic results in matroid theory
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Matroid and knapsack center problems
The set coincidence game: Complexity, attainability, and symmetric strategies
The \(\beta\)-assignment problems
Facet defining inequalities for the dichotomous knapsack problem
The fault-tolerant capacitated \(K\)-center problem
The dominance assignment problem
Clutter nonidealness
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
Ideal clutters
Generalized multiple objective bottleneck problems
Experimental analysis of heuristics for the bottleneck traveling salesman problem
Two algorithms for determining a minimum independent dominating set
HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
Linear and combinatorial sharing problems
Tight Probability Bounds with Pairwise Independence
The complexity of ultrametric partitions on graphs
Fault tolerant \(K\)-center problems
Fractional packing in ideal clutters
Representation of the non-dominated set in biobjective discrete optimization
Sign-central matrices
The matroids with the max-flow min-cut property
On a certain class of nonideal clutters
Easy and hard bottleneck location problems
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
Stability of two player game structures
A combinatorial approach to nonlocality and contextuality
Applying Lehman's theorems to packing problems
On incomparable collections of sets
Generalized Bottleneck Problems^∗
The travelling salesman problem and a class of polyhedra of diameter two
Polynomial-time algorithms for regular set-covering and threshold synthesis
Minmax combinatorial optimization
Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales
Anti-blocking polyhedra
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
An efficient heuristic algorithm for the bottleneck traveling salesman problem
The disjunctive procedure and blocker duality
A class of bottleneck expansion problems
Which graphs occur as \(\gamma\)-graphs?
On generalized balanced optimization problems
Opposite Elements in Clutters
A fast algorithm for a class of bottleneck problems
On \(k\)-sum optimization
An improved algorithm for two stage time minimization assignment problem
On combinatorial properties of binary spaces
An augmenting path method for solving linear bottleneck transportation problems
Combinatorial characterization of read-once formulae
An augmenting path method for solving linear bottleneck assignment problems
The \(k\)-centrum shortest path problem
Cuboids, a class of clutters
The quadratic balanced optimization problem
Some insight into characterizations of minimally nonideal matrices
Transformation and decomposition of clutters into matroids
An abstract duality
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
Idealness of k-wise Intersecting Families
Simple games versus weighted voting games: bounding the critical threshold value
Testing idealness in the filter oracle model
Tropical Kirchhoff's formula and postoptimality in matroid optimization
Structure of cubic Lehman matrices
The Helly property and satisfiability of Boolean formulas defined on set families
Approximating the discrete time-cost tradeoff problem with bounded depth
Approximating the discrete time-cost tradeoff problem with bounded depth
On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
Clean Clutters and Dyadic Fractional Packings
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Idealness of \(k\)-wise intersecting families
Lehman's theorem and the directed Steiner tree problem
On the composition and decomposition of clutters
Solution structures and sensitivity of special assignment problems
The nonidealness index of rank-ideal matrices
Intersecting restrictions in clutters
Approximation and decomposition in lattices of clutters
Order selection on a single machine with high set-up costs
Monotone bargaining is Nash-solvable

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)