Neighborhood persistency of the linear optimization relaxation of integer linear optimization

DOI10.1007/978-3-031-18530-4_23zbMath1528.90149arXiv2203.04557MaRDI QIDQ6166912

Kotaro Nakayama, Kei Kimura

Publication date: 3 August 2023

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

Full work available at URL: https://arxiv.org/abs/2203.04557

zbMATH Keywords

linear optimizationpersistencyinteger linear optimizationunit-two-variable-per-inequality system

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Solving min ones 2-SAT as fast as vertex cover
• The octagon abstract domain
• Disjoint homotopic paths and trees in a planar graph
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Half-integrality, LP-branching, and FPT Algorithms
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• Combining Traditional Map Labeling with Boundary Labeling
• Vertex packings: Structural properties and algorithms
• On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
• Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
• Faster Parameterized Algorithms Using Linear Programming
• Frontiers of Combining Systems

This page was built for publication: Neighborhood persistency of the linear optimization relaxation of integer linear optimization