Multi-objective branch and bound (Q1753506): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2582889117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving efficiently the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Pareto sets by multilevel subdivision techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546412 / 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: Computation of ideal and Nadir values and implications for their use in MCDM methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods / 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: Parallel Branch-and-Branch Algorithms: Survey and Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nadir point for 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: Finding nadir points in multi-objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: Q4667435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / 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: Exact hybrid algorithms for solving a bi-objective vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Optimization Techniques for Exact Multi-Objective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the bi-objective integer knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation methods in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicriteria big cube small cube method / 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: Multiobjective optimization. Interactive and evolutionary approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach / 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 18:13, 15 July 2024

scientific article
Language Label Description Also known as
English
Multi-objective branch and bound
scientific article

    Statements

    Multi-objective branch and bound (English)
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    multiple objective programming
    0 references
    branch and bound
    0 references
    bound sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers