Integer Programming and Combinatorial Optimization

DOI10.1007/b97946zbMath1092.68074OpenAlexW2484779063MaRDI QIDQ5712450

Endre Boros, Leonid G. Khachiyan, Khaled M. Elbassioni, Vladimir A. Gurvich

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation ⋮ Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Generating 3-vertex connected spanning subgraphs ⋮ Listing minimal edge-covers of intersecting families with applications to connectivity problems ⋮ Generating all vertices of a polyhedron is hard ⋮ Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms

Uses Software

• MCFClass

This page was built for publication: Integer Programming and Combinatorial Optimization