Algorithm robust for the bicriteria discrete optimization problem
From MaRDI portal
Publication:2379865
DOI10.1007/S10479-006-0062-3zbMATH Open1188.90240OpenAlexW1534860133MaRDI QIDQ2379865FDOQ2379865
Authors: Panos Kouvelis, Serpil Sayın 
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
Recommendations
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- An algorithm for solving a class of discrete multicriterion problems
- Bi-objective robust optimisation
- An algorithm for the bi-criterion integer programming problem
- Biobjective robust optimization over the efficient set for Pareto set reduction
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Robust discrete optimization and its applications
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Interval data minmax regret network optimization problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A bicriterion shortest path algorithm
- The robust spanning tree problem with interval data
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming 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
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Performance of the MOSA method for the bicriteria assignment problem
- The shortest path problem with two objective functions
- A modified weighted Tchebycheff metric for multiple objective programming
- Algorithms for nonlinear integer bicriterion problems
- Linear multiple objective programs with zero–one variables
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- An Algorithm for Multiobjective Zero-One Linear Programming
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Bicriteria network flow problems: Integer case
- An algorithm for the biobjective integer minimum cost flow problem
- Three algorithms for bicriteria integer linear programs
Cited In (12)
- Bilevel programming for generating discrete representations in multiobjective optimization
- 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
- Numerical analysis of algorithms for solving bicriteria discrete programming problems
- A scalarization scheme for binary relations with applications to set-valued and robust optimization
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- SVM classification for imbalanced data sets using a multiobjective optimization framework
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective programming
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Finding representative systems for discrete bicriterion optimization problems
Uses Software
This page was built for publication: Algorithm robust for the bicriteria discrete optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379865)
