A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
From MaRDI portal
Publication:6068539
DOI10.1002/net.21914OpenAlexW2991725424WikidataQ126622473 ScholiaQ126622473MaRDI QIDQ6068539
Banu Kabakulak, Z. Caner Taşkın, Ali Emre Pusane
Publication date: 13 November 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21914
symmetryinteger programmingbranch-and-cut algorithmbipartite graphsvalid inequalitiestelecommunications
Operations research, mathematical programming (90-XX) Information and communication theory, circuits (94-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Families of small regular graphs of girth 5
- A note on symmetry reduction for circular traveling tournament problems
- Girth in graphs
- New scaling algorithms for the assignment and minimum mean cycle problems
- Local algorithms, regular graphs of large girth, and random regular graphs
- LDPC Code Designs, Constructions, and Unification
- Approximating the Girth
- Constructions of small regular bipartite graphs of girth 6
- Improving Discrete Model Representations via Symmetry Considerations
- Regular and irregular progressive edge-growth tanner graphs
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- A recursive approach to low complexity codes
- A High Girth Graph Construction
- Computing the Girth of a Planar Graph in Linear Time
This page was built for publication: A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
