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