Solving zero-one multiple objective programs through implicit enumeration

DOI10.1016/0377-2217(83)90157-1zbMath0503.90086OpenAlexW2039987877MaRDI QIDQ1835586

E. P. Winkofsky, Richard F. Deckro

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90157-1

zbMATH Keywords

all efficient pointsextensive computational dataimplicit enumeration based algorithmzero-one, multi-objective program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)

Related Items (20)

Zero-one programming with multiple criteria ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Drilling strategies for frontier areas ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A reference direction approach to multiple objective integer linear programming ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ On some multiobjective optimization problems arising in biology ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM ⋮ Exact algorithm for bi-objective 0-1 knapsack problem ⋮ 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 ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs ⋮ A method for generating all efficient solutions of 0-1 multi-objective linear programming problem ⋮ An interactive procedure for multiple objective integer linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear multiobjective programming
• Generating all maximal efficient faces for multiple objective linear programs
• Solving zero-one multiple objective programs through implicit enumeration
• Theory and algorithms for linear multiple objective programs with zero–one variables
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• Linear multiple objective programs with zero–one variables
• Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Solving Bicriterion Mathematical Programs
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Linear programming with multiple objective functions: Step method (stem)

This page was built for publication: Solving zero-one multiple objective programs through implicit enumeration