A mathematical programming approach for recognizing binet matrices

Cites work

scientific article; zbMATH DE number 3174052 (Why is no real title available?)
scientific article; zbMATH DE number 53949 (Why is no real title available?)
scientific article; zbMATH DE number 1234104 (Why is no real title available?)
scientific article; zbMATH DE number 6850362 (Why is no real title available?)
scientific article; zbMATH DE number 1416629 (Why is no real title available?)
scientific article; zbMATH DE number 2203240 (Why is no real title available?)
scientific article; zbMATH DE number 5873618 (Why is no real title available?)
scientific article; zbMATH DE number 3276429 (Why is no real title available?)
A bidirected generalization of network matrices
A characterization of graphic matroids based on circuit orderings
A circuit characterization of graphic matroids
A decomposition theory for matroids. V: Testing of matrix total unimodularity
A mathematical bibliography of signed and gain graphs and allied areas
A new characterization of graphic matroids
A simple algorithm that proves half‐integrality of bidirected network programming
A strongly polynomial algorithm for bimodular integer linear programming
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
An Almost Linear-Time Algorithm for Graph Realization
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
Biased graphs. II: The three matroids
Binary signed-graphic matroids: representations and recognition algorithms
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Characterization of Totally Unimodular Matrices
Characterizing graphic matroids by a system of linear equations
Combinatorial optimization. Packing and covering
Converting Linear Programs to Network Problems
Decomposition of binary signed-graphic matroids
Decomposition of regular matroids
Implementation of a unimodularity test
Matrices with the Edmonds-Johnson property
Multicommodity flows in planar graphs
Multiflows and disjoint paths of minimum total cost
Multiway cuts in directed and node weighted graphs
On characterizing the class of cographic signed-graphic matroids
On excluded minors of connectivity 2 for the class of frame matroids
On half-integrality of network synthesis problem
On small-depth tree augmentations
On the tree augmentation problem
Optimal network design with end-to-end service requirements
Optimization with binet matrices
Rational and integral \(k\)-regular matrices.
Recognizing binet matrices
Recognizing graphic matroids
Signed graphs
Stable matchings and linear inequalities
The 9-connected excluded minors for the class of quasi-graphic matroids
The excluded minors for 2- and 3-regular matroids
Two commodity network flows and linear programming

This page was built for publication: A mathematical programming approach for recognizing binet matrices

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