Bottleneck extrema - MaRDI portal

Cited in

(only showing first 100 items - show all)

(1,k)-configuration facets for the generalized assignment problem
On incomparable collections of sets
Nash-solvable two-person symmetric cycle game forms
The travelling salesman problem and a class of polyhedra of diameter two
New approximation results for resource replication problems
Selected topics on assignment problems
The equipartition polytope. I: Formulations, dimension and basic facets
Polynomial-time algorithms for regular set-covering and threshold synthesis
Tight Probability Bounds with Pairwise Independence
The set coincidence game: Complexity, attainability, and symmetric strategies
Clutters and matroids
Linear inequalities for flags in graded partially ordered sets
Anti-blocking polyhedra
Experimental analysis of heuristics for the bottleneck traveling salesman problem
An efficient heuristic algorithm for the bottleneck traveling salesman problem
Fairness in academic course timetabling
Easy and hard bottleneck location problems
Minmax combinatorial optimization
Acyclic, or totally tight, two-person game forms: characterization and main properties
Quadratic bottleneck problems
Sign-central matrices
On generalized balanced optimization problems
Generalized Bottleneck Problems^∗
Cuboids, a class of clutters
A fast algorithm for a class of bottleneck problems
The fault-tolerant capacitated \(K\)-center problem
The disjunctive procedure and blocker duality
On effectivity functions of game forms
The quadratic balanced optimization problem
The matroids with the max-flow min-cut property
Clutter nonidealness
Two algorithms for determining a minimum independent dominating set
Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales
On \(k\)-sum optimization
The \(\beta\)-assignment problems
A class of bottleneck expansion problems
On acyclicity of games with cycles
A two-commodity cut theorem
Blocking and anti-blocking pairs of polyhedra
Monotone clutters
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
The complexity of ultrametric partitions on graphs
Fault tolerant \(K\)-center problems
HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
Linear and combinatorial sharing problems
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Which graphs occur as \(\gamma\)-graphs?
Fractional packing in ideal clutters
An improved algorithm for two stage time minimization assignment problem
A simple approach to some basic results in matroid theory
Opposite elements in clutters
Finding the set of alternatives in discrete multicriterion problems
Some insight into characterizations of minimally nonideal matrices
Clutters and semimatroids
On combinatorial properties of binary spaces
Combinatorial characterization of read-once formulae
Facet defining inequalities for the dichotomous knapsack problem
Applying Lehman's theorems to packing problems
On a certain class of nonideal clutters
An augmenting path method for solving linear bottleneck assignment problems
1-factor covers of regular graphs
Ideal clutters
Clutters and circuits
Transformation and decomposition of clutters into matroids
The dominance assignment problem
Ideal clutters that do not pack
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
Generalized multiple objective bottleneck problems
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
An augmenting path method for solving linear bottleneck transportation problems
Stability of two player game structures
On Acyclicity of Games with Cycles
Representation of the non-dominated set in biobjective discrete optimization
The \(k\)-centrum shortest path problem
Bibliography on domination in graphs and some basic definitions of domination parameters
Generalized chessboard complexes and discrete Morse theory
A combinatorial approach to nonlocality and contextuality
scientific article; zbMATH DE number 7348694 (Why is no real title available?)
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
An analogue of Hoffman's circulation conditions for max-balanced flows
Monotone bargaining is Nash-solvable
On Packing Dijoins in Digraphs and Weighted Digraphs
Order selection on a single machine with high set-up costs
Intersecting and dense restrictions of clutters in polynomial time
Structure of cubic Lehman matrices
Solution structures and sensitivity of special assignment problems
A note on clutter partitions
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
Idealness of \(k\)-wise intersecting families
A three-person deterministic graphical game without Nash equilibria
Single commodity-flow algorithms for lifts of graphic and cographic matroids
Clean clutters and dyadic fractional packings
Four results about self-blocking clutters
The nonidealness index of rank-ideal matrices
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
A general Hungarian method for the algebraic transportation problem
A unified interpretation of several combinatorial dualities
An abstract duality
Compositions for matroids with the Fulkerson property
Shortest path with acceleration constraints: complexity and approximation algorithms

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)