Bicriteria integer quadratic programming problems
The authors present a technique to generate the set of efficient solutions of a bicriteria integer quadratic programming problem. First they consider an integer quadratic programming problem with one of the objective function as the principal objective. Next, a sequence of constrained single objective integer quadratic programming problem is solved, by ranking the integer feasible solutions. For this, they start with an optimal feasible solution of a related integer linear programming problem and use a post-optimality procedure to find the next best integer feasible solutions.
- An algorithm for the multiple objective integer linear programming problem
- An improved method for solving multiple criteria problems involving discrete alternatives
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive dynamic programming approach to multicriteria discrete programming
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- scientific article; zbMATH DE number 3557528 (Why is no real title available?)
- Multi-criteria integer linear fractional programming problem
- Solving multiobjective programming problems by discrete representation
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- Numerical analysis of algorithms for solving bicriteria discrete programming problems
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- Three algorithms for bicriteria integer linear programs
- scientific article; zbMATH DE number 6007926 (Why is no real title available?)
- scientific article; zbMATH DE number 1234731 (Why is no real title available?)
This page was built for publication: Bicriteria integer quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709837)
