Perfect, ideal and balanced matrices
From MaRDI portal
Publication:5943927
DOI10.1016/S0377-2217(00)00056-4zbMath1053.15014MaRDI QIDQ5943927
Ajai Kapoor, Michele Conforti, Kristina Vušković, Cornuéjols, Gérard
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Tramp ship routing and scheduling with voyage separation requirements, A packet filter placement problem with application to defense against spoofed denial of service attacks, Good and nice colorings of balanced hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect \(0,\pm 1\) matrices
- Topics on perfect graphs
- Totally balanced and totally unimodular matrices defined by center location problems
- The extremal length of a network
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- A catalog of minimally nonideal matrices
- Ideal 0, 1 matrices
- Resolution and the integrality of satisfiability problems
- Binary integer programs with two variables per inequality
- \((0,\pm 1)\) ideal matrices
- On certain polytopes associated with graphs
- Decomposition of balanced matrices
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Normal hypergraphs and the perfect graph conjecture
- Perfect matchings in balanced hypergraphs
- Perfect and Ideal 0, ±1 Matrices
- A Class of Balanced Matrices Arising from Location Problems
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- On the width—length inequality
- A class of logic problems solvable by linear programming
- A heuristic algorithm for the set covering problem
- Perfect zero–one matrices
- Balanced matrices
- Reliable circuits using less reliable relays
