We propose an interactive approach for multiple objective integer linear programming (MOILP) problems that combines the use of the Tchebycheff metric with cutting plane techniques. At each interaction, the method computes the nondominated solution for the MOILP problem that is closest to a reference point according to the Tchebycheff metric. The information provided by the decision maker in each dialogue phase is used to adjust the next reference point through a sensitivity analysis stage. Cutting plane techniques enable the method to take advantage of computations performed at previous iterations to solve the next scalarizing integer program. We address both theoretical issues and the computational implementation.http://www.sciencedirect.c...
Exactly solving multiobjective integer programming (MOIP) problems is often a very time-consuming pr...
The interactive algorithms are often used [2] to solve multicriteria linear integer pro-gramming pro...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
We propose an interactive approach for multiple objective integer linear programming (MOILP) problem...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
Reference point approaches for multi-objective problems rely on the definition of an achievement sca...
Reference point approaches for multi-objective problems rely on the definition of an achievement sca...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
The basic algorithms having established themselves as fundamental in solving integer multiple object...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
This paper introduces an improved recursive algorithm to generate the set of all nondominated object...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
Exactly solving multiobjective integer programming (MOIP) problems is often a very time-consuming pr...
The interactive algorithms are often used [2] to solve multicriteria linear integer pro-gramming pro...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
We propose an interactive approach for multiple objective integer linear programming (MOILP) problem...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
Reference point approaches for multi-objective problems rely on the definition of an achievement sca...
Reference point approaches for multi-objective problems rely on the definition of an achievement sca...
We propose an interactive reference point approach for multiple objective (mixed) integer linear pro...
The basic algorithms having established themselves as fundamental in solving integer multiple object...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
This paper introduces an improved recursive algorithm to generate the set of all nondominated object...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
Exactly solving multiobjective integer programming (MOIP) problems is often a very time-consuming pr...
The interactive algorithms are often used [2] to solve multicriteria linear integer pro-gramming pro...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...