Disjunctive Programming for Multiobjective Discrete Optimisation
From MaRDI portal
Publication:5137948
DOI10.1287/ijoc.2017.0804OpenAlexW2398179955MaRDI QIDQ5137948
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/416359/1/moip_paper_final.pdf
Related Items
Network Models for Multiobjective Discrete Optimization ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Outer approximation algorithms for convex vector optimization problems
Cites Work
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- Disjunctive programming: Properties of the convex hull of feasible points
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Mixed Integer Linear Programming Formulation Techniques
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Linear multiple objective programs with zero–one variables
