A binary integer linear program with multi-criteria and multi-constraint levels

DOI10.1016/S0305-0548(96)00015-9zbMath0889.90114OpenAlexW2055782437MaRDI QIDQ1373885

Yong Shi, Heeseok Lee

Publication date: 25 November 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00015-9

zbMATH Keywords

multi-criteriabinary integer linear programmulti-constraint levels

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Linear programming (90C05) Boolean programming (90C09)

Related Items (1)

Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• A multiple criteria method for choosing among discrete alternatives
• An interactive dynamic programming approach to multicriteria discrete programming
• Selecting optimal linear production systems in multiple criteria environments
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Solving the Discrete Multiple Criteria Problem using Convex Cones
• An Automatic Method of Solving Discrete Programming Problems
• Linear Optimal Designs and Optimal Contingency Plans
• OPTIMIZING GIVEN SYSTEMS vs. DESIGNING OPTIMAL SYSTEMS: THE DE NOVO PROGRAMMING APPROACH
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• Optimal trade-offs of multiple factors in transfer pricing problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
• Branch-and-Bound Methods: A Survey
• A tree-search algorithm for mixed integer programming problems
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Branch-and-Bound Methods: General Formulation and Properties
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: A binary integer linear program with multi-criteria and multi-constraint levels