Preprocessing and cut generation techniques for multi-objective binary programming

DOI10.1016/j.ejor.2018.10.034zbMath1430.90501OpenAlexW2898140707WikidataQ129049045 ScholiaQ129049045MaRDI QIDQ1755381

Natashia Boland, Hadi Charkhgard, Savelsbergh, Martin W. P.

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.034

zbMATH Keywords

computational complexitypreprocessingcut generationideal pointmulti-objective binary program

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29)

Related Items (2)

Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Approximating combinatorial optimization problems with the ordered weighted averaging criterion

Cites Work

• Unnamed Item
• Unnamed Item
• The \(L\)-shape search method for triobjective integer programming
• An exact algorithm for biobjective mixed integer linear programming problems
• Finding all nondominated points of multi-objective integer programs
• Criteria and dimension reduction of linear multiple criteria optimization problems
• Approximating the Pareto optimal set using a reduced set of objective functions
• Bound sets for biobjective combinatorial optimization problems
• Weakly and properly nonessential objectives in multiobjective optimization problems
• Valid inequalities for mixed integer linear programs
• Computational approach to essential and nonessential objective functions in linear multicriteria optimization
• On the equal-subset-sum problem
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Efficient computation of the search region in multi-objective optimization
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems
• Greedy algorithms for a class of knapsack problems with binary weights
• Consequences of dropping nonessential objectives for the application of MCDM methods
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Conflict graphs in solving integer programming problems
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• Nonessential objectives within network approaches for MCDM
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Interactive Coordination of Objective Decompositions in Multiobjective Programming
• Efficient algorithms for a family of matroid intersection problems
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Multicriteria Optimization

This page was built for publication: Preprocessing and cut generation techniques for multi-objective binary programming