Algorithm robust for the bicriteria discrete optimization problem

DOI10.1007/S10479-006-0062-3zbMath1188.90240OpenAlexW1534860133MaRDI QIDQ2379865

Serpil Sayın, Panos Kouvelis

Publication date: 23 March 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0062-3

zbMATH Keywords

robust optimizationefficient set

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (10)

Bilevel programming for generating discrete representations in multiobjective optimization ⋮ On the quality of discrete representations in multiple objective programming ⋮ Generating equidistant representations in biobjective programming ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ A unified approach to uncertain optimization ⋮ A scalarization scheme for binary relations with applications to set-valued and robust optimization ⋮ SVM classification for imbalanced data sets using a multiobjective optimization framework ⋮ A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals

Uses Software

• CPLEX
• NETGEN

Cites Work

• An algorithm for the bi-criterion integer programming problem
• The shortest path problem with two objective functions
• A modified weighted Tchebycheff metric for multiple objective programming
• Algorithms for nonlinear integer bicriterion problems
• An algorithm for the multiple objective integer linear programming problem
• A bicriterion shortest path algorithm
• Bicriteria network flow problems: Integer case
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Robust discrete optimization and its applications
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Three algorithms for bicriteria integer linear programs
• Interval data minmax regret network optimization problems
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• Performance of the MOSA method for the bicriteria assignment problem
• The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
• An Algorithm for Multiobjective Zero-One Linear Programming
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Linear multiple objective programs with zero–one variables
• An interactive weighted Tchebycheff procedure for multiple objective programming
• An algorithm for the biobjective integer minimum cost flow problem
• The robust spanning tree problem with interval data

This page was built for publication: Algorithm robust for the bicriteria discrete optimization problem