An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
From MaRDI portal
Publication:5879665
DOI10.1080/03155986.2016.1214448zbMath1506.90239OpenAlexW2525966964MaRDI QIDQ5879665
Marta M. B. Pascoal, Joao Carlos Namorado Climaco
Publication date: 2 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2016.1214448
reference pointtwo-phase methodbicriteria problemsChebyshev metricssupported and unsupported non-dominated solutions
Cites Work
- Unnamed Item
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- A comparison of solution strategies for biobjective shortest path problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multiobjective programming and planning
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- On spanning tree problems with multiple objectives
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- An improved algorithm for solving biobjective integer programs
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Finding representative systems for discrete bicriterion optimization problems
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multicriteria path and tree problems: discussion on exact algorithms and applications
This page was built for publication: An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
