Pages that link to "Item:Q5712450"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712450):
Displaying 7 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)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)