Pages that link to "Item:Q2716048"

The following pages link to Combinatorial optimization. Packing and covering (Q2716048):

Displaying 50 items.

• A survey on flows in graphs and matroids (Q298967) (← links)
• The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
• Packing cycles exactly in polynomial time (Q421271) (← links)
• Fractional packing in ideal clutters (Q431029) (← links)
• On circulant thin Lehman matrices (Q484160) (← links)
• Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems (Q491193) (← links)
• Blocking optimal arborescences (Q507342) (← links)
• A new infinite family of minimally nonideal matrices (Q618293) (← links)
• On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
• Ideal clutters (Q697573) (← links)
• Balanced Cayley graphs and balanced planar graphs (Q712243) (← links)
• Consequences of the packing problem (Q825535) (← links)
• A polyhedral view to a generalization of multiple domination (Q832985) (← links)
• Even poset and a parity result for binary linear code (Q855546) (← links)
• Packing six \(T\)-joins in plane graphs (Q896004) (← links)
• Rees cones and monomial rings of matroids (Q924364) (← links)
• Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs (Q925305) (← links)
• The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs (Q942170) (← links)
• Pfaffian graphs, \(T\)-joins and crossing numbers (Q949784) (← links)
• A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
• The nonidealness index of rank-ideal matrices (Q987680) (← links)
• On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
• Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems (Q1011130) (← links)
• On the set covering polyhedron of circulant matrices (Q1015320) (← links)
• Lehman matrices (Q1025999) (← links)
• A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
• The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
• Packing odd circuits in Eulerian graphs (Q1403922) (← links)
• An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
• Square-free perfect graphs. (Q1426100) (← links)
• Random monomial ideals (Q1628515) (← links)
• Packing arborescences in random digraphs (Q1689982) (← links)
• A tight lower bound for the hardness of clutters (Q1698055) (← links)
• Non total-unimodularity neutralized simplicial complexes (Q1707913) (← links)
• On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
• Enumeration of 2-level polytopes (Q1741129) (← links)
• Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
• One-overlapped factorizations of non-abelian groups (Q1756112) (← links)
• Perfectness of clustered graphs (Q1799385) (← links)
• A characterization of weakly bipartite graphs (Q1850558) (← links)
• The facets and the symmetries of the approval-voting polytope (Q1880786) (← links)
• Cuboids, a class of clutters (Q1985449) (← links)
• Depth and regularity of monomial ideals via polarization and combinatorial optimization (Q2000807) (← links)
• Pitch, extension complexity, and covering problems (Q2060545) (← links)
• The star dichromatic number (Q2062686) (← links)
• Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals (Q2078501) (← links)
• Colouring non-even digraphs (Q2094875) (← links)