On the integer-valued variables in the linear vertex packing problem
From MaRDI portal
Publication:4136929
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3361920 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- On the integer-valued variables in the linear vertex packing problem
- Order in Logic and Integral Domains
- Vertex packings: Structural properties and algorithms
Cited in
(18)- Tractability of König edge deletion problems
- New results relating independence and matchings
- Random near-regular graphs and the node packing problem
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Pseudo-Boolean optimization
- Crown reductions for the minimum weighted vertex cover problem
- Persistency of linear programming relaxations for the stable set problem
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- Minimum node covers and 2-bicritical graphs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- On the integer-valued variables in the linear vertex packing problem
- A polyhedral study of the generalized vertex packing problem
- Pseudo-Hamiltonian-connected graphs
- The maximum clique problem
- A theoretical and computational analysis of full strong-branching
- Determining the number of internal stability of a graph
- Estimating the Size of Branch-and-Bound Trees
This page was built for publication: On the integer-valued variables in the linear vertex packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136929)
