Solving zero-one multiple objective programs through implicit enumeration

DOI10.1016/0377-2217(83)90157-1MaRDI QIDQ1835586zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3529595 (Why is no real title available?)
• scientific article; zbMATH DE number 3557528 (Why is no real title available?)
• scientific article; zbMATH DE number 3566554 (Why is no real title available?)
• A revised simplex method for linear multiple objective programs
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• Finding all efficient extreme points for multiple objective linear programs
• Generating all maximal efficient faces for multiple objective linear programs
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Linear multiobjective programming
• Linear multiple objective programs with zero–one variables
• Linear programming with multiple objective functions: Step method (stem)
• Solving Bicriterion Mathematical Programs
• Solving zero-one multiple objective programs through implicit enumeration
• Theory and algorithms for 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

Cited in

(20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835586)