The following pages link to Balanced matrices (Q5659570):
Displaying 50 items.
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Dominating set games. (Q703283) (← links)
- Balanced Cayley graphs and balanced planar graphs (Q712243) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs (Q925305) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids (Q1160629) (← links)
- Properties of balanced and perfect matrices (Q1194854) (← links)
- Structural properties and decomposition of linear balanced matrices (Q1196165) (← links)
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices (Q1204474) (← links)
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs (Q1208345) (← links)
- A note on the total unimodularity of matrices (Q1236586) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- An exact algorithm for multiple depot bus scheduling (Q1319568) (← links)
- Balanced matrices with row sum 3 (Q1336681) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Odd cycles and matrices with integrality properties (Q1823869) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Decomposition of wheel-and-parachute-free balanced bipartite graphs (Q1900140) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Dioïds and semirings: Links to fuzzy sets and other applications (Q2372262) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- Balanced matrices (Q2433704) (← links)
- Good and nice colorings of balanced hypergraphs (Q2433719) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
