Linear multiple objective programs with zero–one variables

DOI10.1007/BF01584332zbMath0377.90070MaRDI QIDQ4156137

Gabriel R. Bitran

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

Multi-criteria integer linear fractional programming problem, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, Unnamed Item, A review of interactive methods for multiobjective integer and mixed-integer programming, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, On efficient sets in vector maximum problems - A brief survey, Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, An algorithm for the bi-criterion integer programming problem, Zero-one programming with multiple criteria, Drilling strategies for frontier areas, Algorithms for nonlinear integer bicriterion problems, Designing a quality control system in a service organization: A goal programming case study, A reference direction approach to multiple objective integer linear programming, Multicriteria dynamic programming with an application to the integer case, An algorithm for the multiple objective integer linear programming problem, Multiple criteria decision support -- a review, Cluster generation and grouping using mathematical programming, A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems, A branch and bound algorithm for mixed zero-one multiple objective linear programming, A multi-objective constrained resource information system project selection method, An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, A fast interactive solution method for large capital expenditure selection problems, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, Solving zero-one multiple objective programs through implicit enumeration, An improved algorithm for solving biobjective integer programs, Algorithm robust for the bicriteria discrete optimization problem, A discussion of scalarization techniques for multiple objective integer programming, A survey of recent developments in multiobjective optimization, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, Optimizing a linear function over an integer efficient set, Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming, Theory and algorithms for linear multiple objective programs with zero–one variables, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach

Cites Work

• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Proper efficiency and the theory of vector maximization
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem