Pages that link to "Item:Q5712450"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712450):
Displaying 11 items.
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs (Q4004839) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311106) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)