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

DOI10.1007/s10287-019-00346-4OpenAlexW2917116383MaRDI QIDQ2010369

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean lexicographic optimization: algorithms \& applications
• Bound sets for biobjective combinatorial optimization problems
• Theory of multiobjective optimization
• 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
• Multi-objective branch and bound
• B\&B solution technique for multicriteria stochastic optimization problems
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• Vector Optimization Problems and Their Solution Concepts
• Partial Order Concepts in Applied Sciences
• A hahn-banach theorem in ordered linear spaces and its applications
• Optimization with Stochastic Dominance Constraints
• Multicriteria Optimization
• Set-valued Optimization

This page was built for publication: B{\&}B method for discrete partial order optimization