The search-and-remove algorithm for biobjective mixed-integer linear programming problems

DOI10.1016/J.EJOR.2018.01.026zbMath1403.90617OpenAlexW2790266462MaRDI QIDQ1754323

Banu Soylu

Publication date: 30 May 2018

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.01.026

zbMATH Keywords

integer programmingmultiple objective programmingbound setsbiobjective mixed-integer linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29)

Related Items (9)

Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ A fast and robust algorithm for solving biobjective mixed integer programs ⋮ An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ Bi-objective optimisation over a set of convex sub-problems

Uses Software

• CPLEX
• FEASPUMP

Cites Work

• Unnamed Item
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• 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
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• An exact algorithm for biobjective mixed integer linear programming problems
• A parametric simplex algorithm for linear vector optimization problems
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Bound sets for biobjective combinatorial optimization problems
• Multiobjective programming and planning
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Local branching
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• The feasibility pump
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• Bicriteria p-Hub Location Problems and Evolutionary Algorithms
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• A combined approach to solve binary multicriteria problems
• Bicriteria Transportation Problem
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Error Detecting and Error Correcting Codes
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: The search-and-remove algorithm for biobjective mixed-integer linear programming problems