Name
Abstract | ||
|---|---|---|
We present a new theorem to lift facets of the vertex packing problem. We prove the result and analyse its implications, showing that it generalizes a previous lifting theorem that was proved in 1983. The theorem is illustrated with some examples. Finally, we introduce two new families of facet-defining graphs that can be obtained as a consequence of this new lifting. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11590-018-1312-4 | Optimization Letters |
Keywords | Field | DocType |
Combinatorial optimization, Vertex packing, Facets, Lifting | Lift (force),Discrete mathematics,Graph,Packing problems,Vertex (geometry),Mathematical analysis,Combinatorial optimization,Mathematics | Journal |
Volume | Issue | ISSN |
13.0 | 6.0 | 1862-4480 |
Citations | PageRank | References |
1 | 0.37 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfredo Marín | 1 | 453 | 32.98 |
| Mercedes Pelegrín | 2 | 1 | 0.37 |