Algorithm robust for the bicriteria discrete optimization problem (Q2379865): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-006-0062-3 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NETGEN / rank
 
Normal rank
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.1007/s10479-006-0062-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1534860133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval data minmax regret network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm. / 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: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple criteria combinatorial 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: Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear integer bicriterion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified weighted Tchebycheff metric for multiple objective programming / 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: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria network flow problems: Integer case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three algorithms for bicriteria integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the biobjective integer minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive weighted Tchebycheff procedure for multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of the MOSA method for the bicriteria assignment problem / 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: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-006-0062-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:31, 18 December 2024

scientific article
Language Label Description Also known as
English
Algorithm robust for the bicriteria discrete optimization problem
scientific article

    Statements

    Algorithm robust for the bicriteria discrete optimization problem (English)
    0 references
    0 references
    0 references
    23 March 2010
    0 references
    robust optimization
    0 references
    efficient set
    0 references
    0 references
    0 references

    Identifiers