Neighborhood persistency of the linear optimization relaxation of integer linear optimization
From MaRDI portal
Cites work
- L-convexity on graph structures
- A bounded approximation for the minimum cost 2-sat problem
- A kernel of order 2k-c k for vertex cover
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combining traditional map labeling with boundary labeling
- Disjoint homotopic paths and trees in a planar graph
- Faster parameterized algorithms using linear programming
- Frontiers of Combining Systems
- Half-integrality, LP-branching, and FPT algorithms
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Integer programs with bounded subdeterminants and two nonzeros per row
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
- Neighborhood persistency of the linear optimization relaxation of integer linear optimization
- Network flows. Theory, algorithms, and applications.
- On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
- Solving min ones 2-SAT as fast as vertex cover
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- The octagon abstract domain
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Vertex packings: Structural properties and algorithms
This page was built for publication: Neighborhood persistency of the linear optimization relaxation of integer linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885423)
