On the integer-valued variables in the linear vertex packing problem
From MaRDI portal
Publication:4136929
DOI10.1007/BF01593772zbMATH Open0362.90065OpenAlexW2005982472MaRDI QIDQ4136929FDOQ4136929
Jean-Claude Picard, Maurice Queyranne
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593772
Linear programming (90C05) Programming involving graphs or networks (90C35) Integer programming (90C10)
Cites Work
Cited In (18)
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- The maximum clique problem
- Crown reductions for the minimum weighted vertex cover problem
- Estimating the Size of Branch-and-Bound Trees
- Pseudo-Boolean optimization
- Persistency of linear programming relaxations for the stable set problem
- Determining the number of internal stability of a graph
- A polyhedral study of the generalized vertex packing problem
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Random near-regular graphs and the node packing problem
- Minimum node covers and 2-bicritical graphs
- On the integer-valued variables in the linear vertex packing problem
- New results relating independence and matchings
- Pseudo-Hamiltonian-connected graphs
- Tractability of König edge deletion problems
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- A theoretical and computational analysis of full strong-branching
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)
