A binary integer linear program with multi-criteria and multi-constraint levels
From MaRDI portal
Publication:1373885
DOI10.1016/S0305-0548(96)00015-9zbMATH Open0889.90114OpenAlexW2055782437MaRDI QIDQ1373885FDOQ1373885
Authors: 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
Recommendations
- An integer linear programming problem with multi-criteria and multi-constraint levels: A branch-and-partition algorithm
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
- scientific article; zbMATH DE number 3902394
- scientific article
- An interior-point approach for solving MC\(^2\) linear programming problems
Linear programming (90C05) Multi-objective and goal programming (90C29) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Automatic Method of Solving Discrete Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- Title not available (Why is that?)
- A tree-search algorithm for mixed integer programming problems
- Linear multiobjective programming
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- A multiple criteria method for choosing among discrete alternatives
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Title not available (Why is that?)
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Title not available (Why is that?)
- OPTIMIZING GIVEN SYSTEMS vs. DESIGNING OPTIMAL SYSTEMS: THE DE NOVO PROGRAMMING APPROACH
- Title not available (Why is that?)
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Title not available (Why is that?)
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program
- Title not available (Why is that?)
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- An interactive dynamic programming approach to multicriteria discrete programming
- Selecting optimal linear production systems in multiple criteria environments
- Linear Optimal Designs and Optimal Contingency Plans
- Optimal trade-offs of multiple factors in transfer pricing problems
Cited In (4)
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
- An integer linear programming problem with multi-criteria and multi-constraint levels: A branch-and-partition algorithm
- Title not available (Why is that?)
- Formulation of multiple-choice situations in linear programming models using binary coding matrices
This page was built for publication: A binary integer linear program with multi-criteria and multi-constraint levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373885)
