Name
Abstract | ||
|---|---|---|
We consider the class of biobjective mixed integer linear programs (BOMILPs). We review fathoming rules for general BOMILPs and present them in a unified manner. We then propose new fathoming rules that rely on solving specially designed LPs, hence making no assumption on the type of problem and only using polynomial-time algorithms. We describe an enhancement for carrying out these rules by performing a limited number of pivot operations on an LP, and then we provide insight that helps to make these rules even more efficient by either focusing on a smaller number of feasible solutions or by resorting to heuristics that limit the number of LPs solved. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disopt.2016.09.003 | Discrete Optimization |
Keywords | DocType | Volume |
Nadir point,Nadir set,Bound set,Pareto point,Branch-and-bound | Journal | 22 |
ISSN | Citations | PageRank |
1572-5286 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro Belotti | 1 | 393 | 21.19 |
| Banu Soylu | 2 | 82 | 6.17 |
| Margaret M. Wiecek | 3 | 213 | 22.90 |