A model of anytime algorithm performance for bi-objective optimization (Q2022237): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPOT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3024170895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deliberation scheduling for problem solving in time-constrained environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime Pareto local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal schedules for monitoring anytime algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Methods for the Analysis of Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monitoring and control of anytime algorithms: A dynamic programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representations for an unconstrained bi-objective combinatorial optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically improving the anytime behaviour of optimisation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining VNS with constraint programming for solving anytime optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / 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: Representation of the non-dominated set in biobjective discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Klee's measure problem for grounded boxes / rank
 
Normal rank

Latest revision as of 14:55, 25 July 2024

scientific article
Language Label Description Also known as
English
A model of anytime algorithm performance for bi-objective optimization
scientific article

    Statements

    A model of anytime algorithm performance for bi-objective optimization (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2021
    0 references
    multi-objective optimization
    0 references
    combinatorial optimization
    0 references
    anytime algorithms
    0 references
    anytime behavior
    0 references
    \(\varepsilon\)-constraint
    0 references
    0 references
    0 references
    0 references

    Identifiers