scientific article; zbMATH DE number 3566554
From MaRDI portal
zbMath0363.90082MaRDI QIDQ4138487
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, An algorithm for the bi-criterion integer programming problem, A class of practical interactive branch and bound algorithms for multicriteria integer programming, Zero-one programming with multiple criteria, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Solving multiple criteria problems by interactive decomposition, Multicriteria dynamic programming with an application to the integer case, An algorithm for the multiple objective integer linear programming problem, An interactive dynamic programming approach to multicriteria discrete programming, Theory and algorithms for linear multiple objective programs with zero–one variables, Optimizing a linear function over an integer efficient set, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, Solving zero-one multiple objective programs through implicit enumeration, An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, Cutting plane method for multiple objective stochastic integer linear programming, An interactive procedure for multiple objective integer linear programming problems, On efficient sets in vector maximum problems - A brief survey, Analysis of multicriteria decision aid in Europe
