An exact algorithm for biobjective mixed integer linear programming problems

DOI10.1016/j.cor.2016.03.001zbMath1349.90650OpenAlexW2297511637MaRDI QIDQ342401

Gazi Bilal Yıldız, Banu Soylu

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.03.001

zbMATH Keywords

Hamming distancemulti-objective linear programming\(\epsilon\)-constraint methodologybiobjective mixed-integer linear programmingtabu constraint

Mathematics Subject Classification ID

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

Related Items (max. 100)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming

Uses Software

• CPLEX
• FEASPUMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Multiobjective programming and planning
• Linear multiobjective programming
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Local branching
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• Multi-objective integer programming: an improved recursive algorithm
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• Proper efficiency and the theory of vector maximization
• The feasibility pump
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• Bicriteria Transportation Problem
• Linear Multiparametric Programming by Multicriteria Simplex Method
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• 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: An exact algorithm for biobjective mixed integer linear programming problems