scientific article; zbMATH DE number 3121293

Cited in

(only showing first 100 items - show all)

Graphic matroids and the multicommodity transportation problem
Maximal generating degrees of integral closures of powers of monomial ideals
The enemy of my enemy is my friend: new conditions for network games
A Petri net based approach for multi-robot path planning
Systems of representatives
Connected and alternating vectors: Polyhedra and algorithms
Lineare Programme und allgemeine Vertretersysteme
Structural properties and recognition of restricted and strongly unimodular matrices
Unimodular matrices of flow problems with additional constraints
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Optimisation and hypergraph theory
Restricted coloring models for timetabling
On the integer properties of scheduling set partitioning models
Unimodular functions
Equilibrium in an exchange economy with multiple indivisible commodities and money
Minimum power partial multi-cover on a line
Packing and covering of crossing families of cuts
Total dual integrality of the linear complementarity problem
Cost-performance tradeoffs for interconnection networks
Total unimodularity applications in bi-objective discrete optimization
Anti-blocking polyhedra
Relevance of network theory to models of distributed/parallel processing
Complement total unimodularity
Maximum-Minimum Sätze über Graphen
Housing market short-term equilibriums maximizing linear utility functions
Convexity and global optimization: A theoretical link
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
A matrix criterion for structural balance
Recent trends in combinatorial optimization
Network tomography for integer-valued traffic
Compactifications of the Generalized Jacobian Variety
2-modular matrices
I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
The incidence structure of subspaces with well-scaled frames
On total unimodularity of edge-edge adjacency matrices
Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
Integer plane multiflow maximisation: one-quarter-approximation and gaps
Set characterizations and convex extensions for geometric convex-hull proofs
Implementation of a unimodularity test
On properties of unit interval graphs with a perceptual motivation
Total unimodularity and the Euler-subgraph problem
Edmonds polytopes and a hierarchy of combinatorial problems
A characterization of the orientations of ternary matroids
Local optimality subsets and global optimization: A prospective approach
On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
Approximation algorithms for hard capacitated \(k\)-facility location problems
Extremal configurations and decomposition theorems. I
Extreme points of Leontief substitution systems
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

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)