Pages that link to "Item:Q1015320"

The following pages link to On the set covering polyhedron of circulant matrices (Q1015320):

Displaying 25 items.

• The discriminance for a special class of circulant matrices and their diagonalization (Q275128) (← links)
• Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
• Minor related row family inequalities for the set covering polyhedron of circulant matrices (Q324828) (← links)
• The computation of the square roots of circulant matrices (Q716072) (← links)
• Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
• Notes on ``Ideal 0, 1 matrices'' by Cornuéjols and Novick (Q947733) (← links)
• The nonidealness index of rank-ideal matrices (Q987680) (← links)
• On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
• Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
• Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
• Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
• UB-matrices and conditions for Poncelet polygon to be closed (Q1863525) (← links)
• Computing the square roots of a class of circulant matrices (Q1952902) (← links)
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
• The minor inequalities in the description of the set covering polyhedron of circulant matrices (Q2441576) (← links)
• Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)
• Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
• On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
• Strength of facets for the set covering and set packing polyhedra on circulant matrices (Q2840523) (← links)
• On the dominating set polytope of web graphs (Q2840527) (← links)
• Row family inequalities for the set covering polyhedron (Q2861548) (← links)
• The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs (Q2861550) (← links)
• Arithmetic relations in the set covering polyhedron of circulant clutters (Q3503540) (← links)
• The nonidealness index of circulant matrices (Q3503550) (← links)
• (Q4536143) (← links)