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

DOI10.1016/0377-2217(86)90168-2zbMath0592.90086OpenAlexW1998974905MaRDI 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 algorithmsbranch-and- boundComputational experienceinteractive solutionmulticriteria integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (12)

Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An interactive algorithm for solving multiple objective integer linear programming problems ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ A reference direction approach to multiple objective integer linear programming ⋮ The multiscenario lot size problem with concave costs. ⋮ Multiple criteria decision support -- a review ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ Multiobjective solution of the uncapacitated plant location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the bi-criterion integer programming problem
• Duality for nonlinear multiple-criteria optimization problems
• An algorithm for the multiple objective integer linear programming problem
• An interactive dynamic programming approach to multicriteria discrete programming
• A Survey of Multiple Criteria Integer Programming Methods
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Identifying Efficient Vectors: Some Theory and Computational Results
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Comparative Evaluation of Some Interactive Approaches to Multicriterion Optimization
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• An interactive weighted Tchebycheff procedure for multiple objective programming

This page was built for publication: A class of practical interactive branch and bound algorithms for multicriteria integer programming