A class of practical interactive branch and bound algorithms for multicriteria integer programming

DOI10.1016/0377-2217(86)90168-2zbMath0592.90086MaRDI QIDQ1075953

B. George

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90168-2

zbMATH Keywords

hybrid algorithms; branch-and- bound; Computational experience; interactive solution; multicriteria integer programming

Mathematics Subject Classification ID

90C10: Integer programming

90C31: Sensitivity, stability, parametric optimization

90B50: Management decision making, including multiple objectives

Related Items

A reference direction approach to multiple objective integer linear programming, Multiple criteria decision support -- a review, An interactive procedure for multiple objective integer linear programming problems, An interactive algorithm for solving multiple objective integer linear programming problems, A binary integer linear program with multi-criteria and multi-constraint levels, The multiscenario lot size problem with concave costs., An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, Multiobjective solution of the uncapacitated plant location problem, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic