An exact algorithm for biobjective integer programming problems
From MaRDI portal
Publication:2668742
DOI10.1016/j.cor.2021.105298OpenAlexW3150656628MaRDI QIDQ2668742
Saliha Ferda Doğan, Firdevs Ulus, Özlem Karsu
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.07428
Related Items (3)
An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Primal and dual approximation algorithms for convex vector optimization problems
- An algorithm for the bi-criterion integer programming problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Scalarizing vector optimization problems
- The biobjective travelling purchaser problem
- Finding a representative nondominated set for multi-objective mixed integer programs
- An improved algorithm for solving biobjective integer programs
- A Benson type algorithm for nonconvex multiobjective programming problems
- A two-stage approach for bi-objective integer linear programming
- Two phase algorithms for the bi-objective assignment problem
- Finding representative systems for discrete bicriterion optimization problems
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
- Vector Optimization with Infimum and Supremum
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Adaptive Scalarization Methods in Multiobjective Optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- 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 integer programming problems
