Cone contraction and reference point methods for multi-criteria mixed integer optimization
From MaRDI portal
(Redirected from Publication:2355896)
Recommendations
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- On the convergence of reference point methods in multiobjective programming
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes
- Use of Convex Cones in Interactive Multiple Objective Decision Making
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
Cites work
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An interactive approximation algorithm for multi-objective integer programs
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Evolutionary Multi-Criterion Optimization
- scientific article; zbMATH DE number 3858874 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- Multicriteria Optimization
- Multiobjective combinatorial optimization: some approaches
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
Cited in
(3)
This page was built for publication: Cone contraction and reference point methods for multi-criteria mixed integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355896)