B{\&}B method for discrete partial order optimization
From MaRDI portal
Publication:2010369
DOI10.1007/S10287-019-00346-4OpenAlexW2917116383MaRDI QIDQ2010369FDOQ2010369
Authors: Vladimir I. Norkin
Publication date: 27 November 2019
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-019-00346-4
Recommendations
Cites Work
- Theory of multiobjective optimization
- Optimization with Stochastic Dominance Constraints
- Multicriteria Optimization
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- Set-valued optimization. An introduction with applications
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- Bound sets for biobjective combinatorial optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hahn-banach theorem in ordered linear spaces and its applications
- Vector optimization problems and their solution concepts
- Boolean lexicographic optimization: algorithms \& applications
- Title not available (Why is that?)
- Multi-objective branch and bound
- B\&B solution technique for multicriteria stochastic optimization problems
- Partial Order Concepts in Applied Sciences
Cited In (2)
This page was built for publication: B{\&}B method for discrete partial order optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010369)