Solving Linear Programs without Breaking Abstractions
From MaRDI portal
Publication:3177754
DOI10.1145/2822890zbMath1426.68111OpenAlexW2211319681WikidataQ58215449 ScholiaQ58215449MaRDI QIDQ3177754
No author found.
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/251099
linear programmingmaximum matchingellipsoid methodfixed-point logic with countingchoiceless polynomial time
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Logic in computer science (03B70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem, On the Weisfeiler-Leman dimension of fractional packing, On Weisfeiler-Leman invariance: subgraph counts and related graph properties, Definable Inapproximability: New Challenges for Duplicator, Canonisation and Definability for Graphs of Bounded Rank Width