Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
From MaRDI portal
Publication:5139847
DOI10.1287/ijoc.2019.0891OpenAlexW2957562111MaRDI QIDQ5139847
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0891
optimization over the efficient setmultiobjective linear programmingPareto set reductiondominance filteringbiobjective mixed binary programming
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A two phase approach for the bi-objective non-convex combined heat and power production planning problem
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Biobjective robust optimization over the efficient set for Pareto set reduction
- On finding representative non-dominated points for bi-objective integer network flow problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Representation of the non-dominated set in biobjective discrete optimization
- An exact algorithm for biobjective mixed integer linear programming problems
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Optimization over the efficient set: overview
- Benson type algorithms for linear vector optimization and applications
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Determining maximal efficient faces in multiobjective linear programming problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Nonlinear multiobjective optimization
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Outcome space partition of the weight set in multiobjective linear programming
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Maximizing a concave function over the efficient or weakly-efficient set
- A post-optimality analysis algorithm for multi-objective optimization
- An algorithm for optimizing a linear function over an integer efficient set
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Two phase algorithms for the bi-objective assignment problem
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- Diversity Maximization Approach for Multiobjective Optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Disjunctive Programming
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Multicriteria Optimization
- Optimization over the efficient set
This page was built for publication: Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
