An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
DOI10.1080/03155986.2016.1214448zbMATH Open1506.90239OpenAlexW2525966964MaRDI QIDQ5879665FDOQ5879665
Authors: 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
Recommendations
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- On the Structure of the Non-dominated Set for Bicriteria Programmes
- scientific article; zbMATH DE number 1784652
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Algorithms for nonlinear integer bicriterion problems
- scientific article; zbMATH DE number 4049388
- On the Concepts of Nondominated Solutions for Multiobjective Linear Programming Problems with Interval Coefficients
- scientific article; zbMATH DE number 1234731
- Efficiency and solution approaches to bicriteria nonconvex programs
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
reference pointtwo-phase methodbicriteria problemsChebyshev metricssupported and unsupported non-dominated solutions
Cites Work
- Title not available (Why is that?)
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Multiobjective programming and planning
- Finding representative systems for discrete bicriterion optimization problems
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A comparison of solution strategies for biobjective shortest path problems
- On spanning tree problems with multiple objectives
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- An improved algorithm for solving biobjective integer programs
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Computing all efficient solutions of the biobjective minimum spanning tree problem
Cited In (2)
This page was built for publication: An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879665)
