Pages that link to "Item:Q1615968"
From MaRDI portal
The following pages link to A branch-and-cut technique to solve multiobjective integer quadratic programming problems (Q1615968):
Displaying 12 items.
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem (Q260685) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
- Biobjective optimization over the efficient set of multiobjective integer programming problem (Q2031318) (← links)
- Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- Application of stochastic programming technique to solve interval quadratic programming problem (Q2669815) (← links)
- Branch and cut method for solving integer indefinite quadratic bilevel programs (Q2675637) (← links)
- Bicriteria integer quadratic programming problems (Q2709837) (← links)
- An indefinite quadratic optimization over an integer efficient set (Q3177625) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5706028) (← links)
- An algorithm to solve multi-objective integer quadratic programming problem (Q6596965) (← links)
