Bicriteria integer quadratic programming problems
From MaRDI portal
Publication:2709837
DOI10.1080/09720502.2000.10700277zbMath0986.90048OpenAlexW2051094211MaRDI QIDQ2709837
Publication date: 5 June 2002
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2000.10700277
Integer programming (90C10) Multi-objective and goal programming (90C29) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- An algorithm for the multiple objective integer linear programming problem
- 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
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An improved method for solving multiple criteria problems involving discrete alternatives
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Solving multiobjective programming problems by discrete representation
- Multi-criteria integer linear fractional programming problem
This page was built for publication: Bicriteria integer quadratic programming problems