Disjunctive Programming for Multiobjective Discrete Optimisation
From MaRDI portal
Publication:5137948
Recommendations
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- scientific article; zbMATH DE number 2209474
- Network Models for Multiobjective Discrete Optimization
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
Cites work
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman 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
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An algorithm for the multiple objective integer linear programming problem
- 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
- Disjunctive programming: Properties of the convex hull of feasible points
- Finding all nondominated points of multi-objective integer programs
- Linear multiple objective programs with zero–one variables
- Mixed integer linear programming formulation techniques
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
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
- On the quality of discrete representations in multiple objective programming
- Network Models for Multiobjective Discrete Optimization
- 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
- scientific article; zbMATH DE number 4215847 (Why is no real title available?)
- 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)
