Preprocessing and cut generation techniques for multi-objective binary programming
type: Item
instance of: scholarly article
title: Preprocessing and cut generation techniques for multi-objective binary programming
zbMATH Open document ID: 1430.90501
author: Natashia Boland
author: Hadi Charkhgard
author: Martin W. P. Savelsbergh
published in: European Journal of Operational Research
publication date: 2019-01-09T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6999085
zbMATH Keywords: multi-objective binary program
zbMATH Keywords: ideal point
zbMATH Keywords: computational complexity
zbMATH Keywords: preprocessing
zbMATH Keywords: cut generation
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.10.034
OpenAlex ID: W2898140707
cites work: Conflict graphs in solving integer programming problems
cites work: Fathoming rules for biobjective mixed integer linear programs: review and extensions
cites work: The \(L\)-shape search method for triobjective integer programming
cites work: A new method for optimizing a linear function over the efficient set of a multiobjective integer program
cites work: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
cites work: Valid inequalities for mixed integer linear programs
cites work: Efficient computation of the search region in multi-objective optimization
cites work: Multicriteria Optimization
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Multiple criteria optimization: State of the art annotated bibliographic surveys
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: Interactive Coordination of Objective Decompositions in Multiobjective Programming
cites work: Efficient algorithms for a family of matroid intersection problems
cites work: Consequences of dropping nonessential objectives for the application of MCDM methods
cites work: Nonessential objectives within network approaches for MCDM
cites work: Q4198056
cites work: Q3075630
cites work: Greedy algorithms for a class of knapsack problems with binary weights
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: Approximating the Pareto optimal set using a reduced set of objective functions
cites work: Finding all nondominated points of multi-objective integer programs
cites work: Computational approach to essential and nonessential objective functions in linear multicriteria optimization
cites work: Weakly and properly nonessential objectives in multiobjective optimization problems
cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: The search-and-remove algorithm for biobjective mixed-integer linear programming problems
cites work: An exact algorithm for biobjective mixed integer linear programming problems
cites work: Criteria and dimension reduction of linear multiple criteria optimization problems
cites work: On the equal-subset-sum problem
Wikidata QID: Q129049045
DOI: 10.1016/J.EJOR.2018.10.034
description: scientific article; zbMATH DE number 6999085