Name
Abstract | ||
|---|---|---|
This work presents a way to eliminate redundant solutions (due to geometrical symmetries) of linear integer programs by adding appropriate inequalities to a given formulation. In some of the examples considered, this approach leads to an impressive reduction of the search tree of enumerative algorithms. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.endm.2004.06.032 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Integer programming,redundant solutions,symmetry | Integer,Discrete mathematics,Combinatorics,Nearest integer function,Branch and price,Integer points in convex polyhedra,Integer programming,Mathematics,Homogeneous space,Search tree | Journal |
Volume | ISSN | Citations |
18 | 1571-0653 | 3 |
PageRank | References | Authors |
0.40 | 4 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo A. Rey | 1 | 25 | 4.58 |