Pages that link to "Item:Q1278795"
From MaRDI portal
The following pages link to A reduction algorithm for integer multiple objective linear programs (Q1278795):
Displaying 11 items.
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- A dual-based algorithm for solving lexicographic multiple objective programs (Q853009) (← links)
- A note on reducing the number of variables in integer programming problems (Q1369365) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- (Q4029789) (← links)
- (Q4792349) (← links)