Branch-and-bound and objective branching with three or more objectives (Q2676405): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2022.106012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293879931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound for Biobjective Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming for Multiobjective Discrete Optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L\)-shape search method for triobjective integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using multiobjective optimization to map the entropy region / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound sets for biobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benson type algorithms for linear vector optimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Multiobjective Zero-One Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of the search region in multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the multiple objective integer linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: an improved recursive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound for Bi-objective Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of the optimal biobjective spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiobjective Mixed Integer Convex Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach for biobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank

Latest revision as of 05:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-bound and objective branching with three or more objectives
scientific article

    Statements

    Branch-and-bound and objective branching with three or more objectives (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    multi-objective combinatorial optimization
    0 references
    multi-objective integer programming
    0 references
    branch \& bound
    0 references
    objective branching
    0 references
    bound sets
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers