B{\&}B method for discrete partial order optimization

DOI10.1007/S10287-019-00346-4MaRDI QIDQ2010369zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• B\&B method for discrete partial order and quasiorder optimizations
• Multi-objective branch and bound
• A general branch-and-bound framework for continuous global multiobjective optimization
• Outer branching: how to optimize under partial orders?
• New applications of partial orders

Cites work

• scientific article; zbMATH DE number 3925652 (Why is no real title available?)
• scientific article; zbMATH DE number 1149800 (Why is no real title available?)
• scientific article; zbMATH DE number 1784662 (Why is no real title available?)
• scientific article; zbMATH DE number 1836568 (Why is no real title available?)
• A hahn-banach theorem in ordered linear spaces and its applications
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• B\&B solution technique for multicriteria stochastic optimization problems
• Boolean lexicographic optimization: algorithms \& applications
• Bound sets for biobjective combinatorial optimization problems
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Multi-objective branch and bound
• Multi-objective optimization using evolutionary algorithms
• Multicriteria Optimization
• Optimization with Stochastic Dominance Constraints
• Partial Order Concepts in Applied Sciences
• Set-valued optimization. An introduction with applications
• Theory of multiobjective optimization
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Vector optimization problems and their solution concepts

Cited in

(2)

• Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems
• An order optimal solver for the discretized bidomain equations

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)