Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2942148196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bi-criterion integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / 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: Multiobjective solution of the uncapacitated plant location problem / 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: An improved cut-and-solve algorithm for the single-source capacitated facility location problem / 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: An Algorithm for Multiobjective Zero-One Linear Programming / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265265 / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / 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: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / 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 04:42, 24 July 2024

scientific article; zbMATH DE number 7283456
Language Label Description Also known as
English
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
scientific article; zbMATH DE number 7283456

    Statements

    Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    bi-objective branch-and-cut
    0 references
    bi-objective optimization
    0 references
    combinatorial optimization
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references