Perfect, ideal and balanced matrices

European Journal of Operational Research

Volumn 133, Issue 3, 2001, Pages 455-461

  Conforti, Michele ^a   Cornuéjols, Gérard ^b   Kapoor, Ajai ^b   Vuškovǐ, Kristina ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Balanced matrix; Ideal matrix; Perfect graph; Set covering problem; Set packing problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING;

BALANCED MATRIX; POLYHEDRALS;

OPERATIONS RESEARCH;

EID: 0035899770     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00056-4     Document Type: Article

References (41)

1. Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung)
2. Sur certains hypergraphes généralisant les graphes bipartis
3. Balanced matrices
4. Topics on perfect graphs
5. Sur un Théorème du Type König pour les Hypergraphes
6. A heuristic algorithm for the set covering problem
7. On certain polytopes associated with graphs
8. Clutters that pack and the max flow min cut property: A conjecture
9. Balanced 0, ±1 matrices, bicoloring and total dual integrality
10. A class of logic problems solvable by linear programming
11. Perfect 0, ±1 matrices
12. Perfect matchings in balanced hypergraphs
13. Decomposition of balanced matrices
14. Ideal 0, 1 matrices
15. The extremal length of a network
16. A min-max relation for submodular functions on graphs
17. The perfect graph conjecture and pluperfect graph theorem
18. Perfect and ideal 0, ±1 matrices
19. A characterization of weakly bipartite graphs
20. Integral boundary points of convex polyhedra
21. Resolution and the integrality of satisfiability polytopes
22. Degree-two inequalities, clique facets and biperfect graphs
23. Similarity retrieval of iconic image database
24. On the width-length inequality, mimeographic notes (1965)
25. On the width-length inequality and degenerate projective planes
26. Normal hypergraphs and the perfect graph conjecture
27. A catalog of minimally nonideal matrices
28. Reliable circuits using less reliable relays
29. (0, ±1) Ideal matrices
30. Perfect zero-one matrices
31. Binary integer programs with two variables per inequality
32. The matroids with the max-flow min-cut property
33. Matroids and multicommodity flows
34. Scheduling of traffic lights - A new approach
35. A class of balanced matrices arising from location problems
36. Totally balanced and totally unimodular matrices defined by center location poblems