scientific article; zbMATH DE number 3121293

Cited in

(only showing first 100 items - show all)

Red-blue covering problems and the consecutive ones property
Some sequences associated with combinatorial structures
Unimodular functions
Polyhedral proof methods in combinatorial optimization
The existence and computation of competitive equilibria in markets with an indivisible commodity
Discrepancy of set-systems and matrices
On the integer properties of scheduling set partitioning models
Recognizing max-flow min-cut path matrices
Strong unimodularity for matrices and hypergraphs
Optimal representations of partially ordered sets and a limit Sperner theorem
Total unimodularity and the Euler-subgraph problem
The incidence structure of subspaces with well-scaled frames
Short circuit covers for regular matroids with a nowhere zero 5-flow
Subspaces with well-scaled frames
Relevance of network theory to models of distributed/parallel processing
Complement total unimodularity
Total unimodularity and combinatorial theorems
A separable integer programming problem equivalent to its continual version
Chromatic optimisation: Limitations, objectives, uses, references
On the enumeration of chains in regular chain-groups
Cores of partitioning games
Total unimodularity applications in bi-objective discrete optimization
Matching theory -- a sampler: From Dénes König to the present
Cost-performance tradeoffs for interconnection networks
A decomposition theory for matroids. VII: Analysis of minimal violation matrices
Total unimodularity and the transportation problem: a generalization
A proof of Fulkerson's characterization of permutation matrices
On two minimax theorems in graph
Some combinatorial properties of centrosymmetric matrices
A note on the total unimodularity of matrices
On partitions of a partially ordered set
Local unimodularity of matrix-vector pairs
The edge-coloring of complete hypergraphs. I
Two simple applications of the unmodularity property
Restricted coloring models for timetabling
On properties of unit interval graphs with a perceptual motivation
Rational and integral \(k\)-regular matrices.
Equilibrium in an exchange economy with multiple indivisible commodities and money
A characterization of the orientations of ternary matroids
Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies
Maximal determinants of combinatorial matrices
Convex analysis and duality over discrete domains
Total dual integrality of the linear complementarity problem
Discrete convexity and unimodularity. I.
Optimisation and hypergraph theory
On totally dual integral systems
Extending Greene's theorem to directed graphs
The structure and number of global roundings of a graph
Implementation of a unimodularity test
Totally unimodular stochastic programs
Housing market short-term equilibriums maximizing linear utility functions
Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
Box-total dual integrality, box-integrality, and equimodular matrices
Integer plane multiflow maximisation: one-quarter-approximation and gaps
Set characterizations and convex extensions for geometric convex-hull proofs
Maximal generating degrees of powers of homogeneous ideals
Maximal generating degrees of integral closures of powers of monomial ideals
A heuristic method for solving integer-valued decompositional multiindex problems
Network tomography for integer-valued traffic
Determination of optimal vertices from feasible solutions in unimodular linear programming
Balanced matrices
Linear time algorithms for generalized edge dominating set problems
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
Extremal configurations and decomposition theorems. I
Extreme points of Leontief substitution systems
Anti-blocking polyhedra
Edmonds polytopes and a hierarchy of combinatorial problems
The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
The generalized assignment problem with minimum quantities
Approximation algorithms for hard capacitated \(k\)-facility location problems
Minimum power partial multi-cover on a line
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
The bipartite Boolean quadric polytope
Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
Structural search and optimization in social networks
A polytope for a product of real linear functions in 0/1 variables
Compactifications of the Generalized Jacobian Variety
Maximum-Minimum Sätze über Graphen
A matrix criterion for structural balance
Matrices of rational integers
Typical performance of approximation algorithms for NP-hard problems
I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
Partial Colorings of Unimodular Hypergraphs
Comparing Universal Covers in Polynomial Time
Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
A decomposition property of polyhedra
Testing additive integrality gaps
On total unimodularity of edge-edge adjacency matrices
Structural properties and recognition of restricted and strongly unimodular matrices
The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
On the use of alternating chains and hypergraphs in edge coloring
Connected and alternating vectors: Polyhedra and algorithms
On some characterisations of totally unimodular matrices
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
On linear programming duality and Landau's characterization of tournament
A constructive method to recognize the total unimodularity of a matrix

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)