scientific article; zbMATH DE number 3121293

Cited in

(only showing first 100 items - show all)

Disjoint (s, t)‐cuts in a network
Resistant sets in the unit hypercube
Some sequences associated with combinatorial structures
The generalized assignment problem with minimum quantities
Short circuit covers for regular matroids with a nowhere zero 5-flow
The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
On linear programming duality and Landau's characterization of tournament
The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
\(k\)-integrality, an extension of total unimodularity
Optimal representations of partially ordered sets and a limit Sperner theorem
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
On totally unimodular matrices
Rational and integral \(k\)-regular matrices.
Testing additive integrality gaps
The bipartite Boolean quadric polytope
Balanced matrices
Perfect, ideal and balanced matrices
Flots et tensions dans un graphe
A min-max theorem for plane bipartite graphs
Integral rigid sets and periods of nonexpansive maps
Strong unimodularity for matrices and hypergraphs
Matrices of rational integers
Comparing Universal Covers in Polynomial Time
A polytope for a product of real linear functions in 0/1 variables
Recognizing max-flow min-cut path matrices
Decomposing random mechanisms
A decomposition theory for matroids. VII: Analysis of minimal violation matrices
A note on the total unimodularity of matrices
Local unimodularity of matrix-vector pairs
Extended formulations in combinatorial optimization
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
On a variant of Flory model
Poincaré-Hopf inequalities
Maximal generating degrees of powers of homogeneous ideals
Some combinatorial properties of centrosymmetric matrices
Red-blue covering problems and the consecutive ones property
New polynomial-time algorithms for Camion bases
The structure and number of global roundings of a graph
A heuristic method for solving integer-valued decompositional multiindex problems
A network flow approach to a common generalization of Clar and Fries numbers
Unimodularity of the Clar number problem
Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
Polynomial algorithms for a class of linear programs
Compact formulations as a union of polyhedra
Extending Greene's theorem to directed graphs
Total unimodularity and the transportation problem: a generalization
\(L_{p}\) linear discrepancy of totally unimodular matrices
Typical performance of approximation algorithms for NP-hard problems
Über reguläre Kettengruppen
The existence and computation of competitive equilibria in markets with an indivisible commodity
A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
On the use of alternating chains and hypergraphs in edge coloring
Discrepancy of set-systems and matrices
On the enumeration of chains in regular chain-groups
On polynomially solvable constrained input selections for fixed and switched linear structured systems
Cores of partitioning games
Discrete convexity and unimodularity. I.
A decomposition property of polyhedra
Subspaces with well-scaled frames
Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
Linear time algorithms for generalized edge dominating set problems
Stable matching: An integer programming approach
On some characterisations of totally unimodular matrices
Subdeterminants and concave integer quadratic programming
On totally dual integral systems
A constructive method to recognize the total unimodularity of a matrix
Comparing universal covers in polynomial time
Breast cancer prediction using the isotonic separation technique
Integral decomposition in polyhedra
Integer matrices with constraints on leading partial row and column sums
Total unimodularity and combinatorial theorems
Determination of optimal vertices from feasible solutions in unimodular linear programming
Matching theory -- a sampler: From Dénes König to the present
A separable integer programming problem equivalent to its continual version
A proof of Fulkerson's characterization of permutation matrices
Box-total dual integrality, box-integrality, and equimodular matrices
Partial Colorings of Unimodular Hypergraphs
On partitions of a partially ordered set
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
Maximal determinants of combinatorial matrices
Extended formulations in combinatorial optimization
Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies
Balanced matrices
Convex analysis and duality over discrete domains
On two minimax theorems in graph
Two simple applications of the unmodularity property
The edge-coloring of complete hypergraphs. I
Totally unimodular stochastic programs
Polyhedral proof methods in combinatorial optimization
A min-max relation for the partial q-colourings of a graph. II: Box perfection
Chromatic optimisation: Limitations, objectives, uses, references
Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
Structural search and optimization in social networks
Robust optimization of sums of piecewise linear functions with application to inventory problems
Some efficiently solvable problems over integer partition polytopes
\(N\)-fold integer programming and nonlinear multi-transshipment
A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors
Trichotomy for integer linear systems based on their sign patterns
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem

This page was built for publication:

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