Heuristic multiobjective discrete optimization using restricted decision diagrams
From MaRDI portal
Cites work
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- A matheuristic for tri-objective binary integer linear programming
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Decision diagrams for optimization
- Dynamic programming and optimal control. Vol. 2
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- Manipulating MDD relaxations for combinatorial optimization
- Multi-directional local search
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Network Models for Multiobjective Discrete Optimization
- Optimization Bounds from Binary Decision Diagrams
- The feasibility pump
- The triangle splitting method for biobjective mixed integer programming
This page was built for publication: Heuristic multiobjective discrete optimization using restricted decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356175)
