Bottleneck extrema - MaRDI portal

Cited in

(only showing first 100 items - show all)

Intersecting and dense restrictions of clutters in polynomial time
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
Generalized Bottleneck Problems^∗
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
The travelling salesman problem and a class of polyhedra of diameter two
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
Anti-blocking polyhedra
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
On removing a vertex from the assignment polytope
A general Hungarian method for the algebraic transportation problem
The disjunctive procedure and blocker duality
An efficient heuristic algorithm for the bottleneck traveling salesman problem
Flow symmetry and algebraic flows
Shortest path with acceleration constraints: complexity and approximation algorithms
Which graphs occur as \(\gamma\)-graphs?
On generalized balanced optimization problems
A class of bottleneck expansion problems
Application of optimization methods to the hematological support of patients with disseminated malignancies
An analogue of Hoffman's circulation conditions for max-balanced flows
A fast algorithm for a class of bottleneck problems
On \(k\)-sum optimization
About the structure of the blocker of the hyperplanes of a matroid
An improved algorithm for two stage time minimization assignment problem
An augmenting path method for solving linear bottleneck transportation problems
A unified interpretation of several combinatorial dualities
Four results about self-blocking clutters
On combinatorial properties of binary spaces
Combinatorial characterization of read-once formulae
scientific article; zbMATH DE number 7348694 (Why is no real title available?)
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
On the solution of discrete bottleneck problems
Transformation and decomposition of clutters into matroids
Some insight into characterizations of minimally nonideal matrices
Resistant sets in the unit hypercube
An abstract duality
Bottleneck linear programming
Clutters and circuits
(1,k)-configuration facets for the generalized assignment problem
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
Simple games versus weighted voting games: bounding the critical threshold value
Linear inequalities for flags in graded partially ordered sets
Monotone clutters
1-factor covers of regular graphs
Testing idealness in the filter oracle model
Tropical Kirchhoff's formula and postoptimality in matroid optimization
Structure of cubic Lehman matrices
The equipartition polytope. I: Formulations, dimension and basic facets
On effectivity functions of game forms
The Helly property and satisfiability of Boolean formulas defined on set families
Clutters and semimatroids
New approximation results for resource replication problems
Clutters and matroids
Nash-solvable two-person symmetric cycle game forms
Selected topics on assignment problems
Approximating the discrete time-cost tradeoff problem with bounded depth
Approximating the discrete time-cost tradeoff problem with bounded depth
On acyclicity of games with cycles
Idealness of \(k\)-wise intersecting families
On Acyclicity of Games with Cycles
On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Fairness in academic course timetabling
Lehman's theorem and the directed Steiner tree problem
Solution structures and sensitivity of special assignment problems
On the composition and decomposition of clutters
The nonidealness index of rank-ideal matrices
Acyclic, or totally tight, two-person game forms: characterization and main properties
A two-commodity cut theorem
Intersecting restrictions in clutters
Bibliography on domination in graphs and some basic definitions of domination parameters
Quadratic bottleneck problems
Order selection on a single machine with high set-up costs
Opposite elements in clutters
Approximation and decomposition in lattices of clutters
Monotone bargaining is Nash-solvable
Blocking and anti-blocking pairs of polyhedra
A simple approach to some basic results in matroid theory
Generalized chessboard complexes and discrete Morse theory
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Reliability, covering and balanced matrices
Clean tangled clutters, simplices, and projective geometries
The set coincidence game: Complexity, attainability, and symmetric strategies
Tropical Carathéodory with matroids
Finding the set of alternatives in discrete multicriterion problems
The -assignment problems
Facet defining inequalities for the dichotomous knapsack problem
Einige Aspekte in der Zuordnungstheorie
The fault-tolerant capacitated \(K\)-center problem
Compositions for matroids with the Fulkerson property
On ideal clutters, metrics and multiflows
The dominance assignment problem
On Packing Dijoins in Digraphs and Weighted Digraphs
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
Ideal clutters that do not pack
Ideal clutters

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)