The following pages link to (Q3330973):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph (Q313816) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- A short proof of the tree-packing theorem (Q418872) (← links)
- A characterization of the 2-additive Choquet integral through cardinal information (Q429418) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Equality of ordinary and symbolic powers of Stanley-Reisner ideals (Q536163) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
- Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals (Q616884) (← links)
- A transitivity analysis of bipartite rankings in pairwise multi-class classification (Q621565) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Cohen-Macaulayness of large powers of Stanley-Reisner ideals (Q655360) (← links)
- The edge covering number of the intersection of two matroids (Q658021) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- A note on matchings and separability (Q802467) (← links)
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra (Q869913) (← links)
- Minmax relations for cyclically ordered digraphs (Q885290) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs (Q942170) (← links)
- Brick partitions of graphs (Q960924) (← links)
- The generic rank of body-bar-and-hinge frameworks (Q966167) (← links)
- Integral polyhedra related to integer multicommodity flows on a cycle (Q968136) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Integrality properties of edge path tree families (Q1043594) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Edge-disjoint paths in planar graphs (Q1069956) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Maximum balanced flow in a network (Q1569079) (← links)
- On box-perfect graphs (Q1682206) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Shifted matroid optimization (Q1694792) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas (Q1761201) (← links)
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← links)
- On a cardinality-constrained transportation problem with market choice (Q1785735) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
