New facets for the set packing polytope-Reference-Cited by-同舟云学术

New facets for the set packing polytope

Published:2000-11 Issue:4 Volume:27 Page:153-161
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Cánovas Lázaro,Landete Mercedes,Marı́n Alfredo

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference15 articles.

1. Critical cutsets of graphs and canonical facets of set-packing polytopes;Balas;Math. Oper. Res.,1977

2. Compositions of graphs and polyhedra II: Stable sets;Barahona;SIAM J. Discrete Math.,1994

3. Compositions of graphs and polyhedra III: Graphs with no W4 minor;Barahona;SIAM J. Discrete Math.,1994

4. L. Cánovas, M. Landete, A. Marı́n, Facet obtaining procedures for set packing problems, Working paper 4/99, Departamento de Estadı́stica e Investigación Operativa, Universidad de Murcia, 1999.

5. Wheel inequalities for stable set polytopes;Cheng;Math. Programming,1997

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some new clique inequalities in four-index hub location models;European Journal of Operational Research;2024-11

2. New variants of the simple plant location problem and applications;European Journal of Operational Research;2023-05

3. Dynamic node packing;Mathematical Programming;2021-02-12

4. Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic;Mathematical Problems in Engineering;2020-12-16

5. The stable set problem: Clique and nodal inequalities revisited;Computers & Operations Research;2020-11