Optimization with binet matrices
From MaRDI portal
Publication:2467475
DOI10.1016/J.ORL.2006.04.003zbMATH Open1169.90407OpenAlexW2014349805MaRDI QIDQ2467475FDOQ2467475
Konstantinos Papalamprou, Balázs Kotnyek, G. Appa, Leonidas Pitsoulis
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/22768/1/optimization_with_binet_matrices03.59_LSEROVERSION.pdf
Recommendations
- A bidirected generalization of network matrices
- Recognizing binet matrices
- Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
- Some properties of matrices from certain binary mathematical programming problems
- On the integer max-linear programming problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Title not available (Why is that?)
- A bidirected generalization of network matrices
- Binary clutter inequalities for integer programs
- Decomposition and optimization over cycles in binary matroids
- Matrices with the Edmonds-Johnson property
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Rational and integral \(k\)-regular matrices.
Cited In (13)
- On the tree augmentation problem
- On characterizing the extreme points of the generalized transitive tournament polytope
- Title not available (Why is that?)
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A bidirected generalization of network matrices
- Determinant Optimization on Binary Matrices
- Optimization problems involving matrix multiplication with applications in materials science and biology
- Title not available (Why is that?)
- Some properties of matrices from certain binary mathematical programming problems
- Binary signed-graphic matroids: representations and recognition algorithms
- On small-depth tree augmentations
This page was built for publication: Optimization with binet matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467475)
