Disjunctive Programming for Multiobjective Discrete Optimisation
From MaRDI portal
Publication:5137948
DOI10.1287/IJOC.2017.0804OpenAlexW2398179955MaRDI QIDQ5137948FDOQ5137948
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
Cites Work
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Disjunctive programming: Properties of the convex hull of feasible points
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Finding all nondominated points of multi-objective integer programs
- 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
- Linear multiple objective programs with zero–one variables
- Mixed integer linear programming formulation techniques
Cited In (11)
- Distribution based representative sets for multi-objective integer programs
- Outer approximation algorithms for convex vector optimization problems
- Disjunctive programming and the generalized Leontief input-output model
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Network Models for Multiobjective Discrete Optimization
- On the quality of discrete representations in multiple objective programming
- Split algorithms for multiobjective integer programming problems
- Branch-and-bound and objective branching with three or more objectives
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
- Title not available (Why is that?)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
This page was built for publication: Disjunctive Programming for Multiobjective Discrete Optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137948)
