A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2013.04.004 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SPEA2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TTTPLOTS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PERL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133961610 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1201.4342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the matrix bid auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal multiprocessor combinatorial auction solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiple scenarios in a combinatorial auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective and simple heuristic for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.04.004 / rank
 
Normal rank

Latest revision as of 14:46, 9 December 2024

scientific article
Language Label Description Also known as
English
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
scientific article

    Statements

    A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    Pareto optimization
    0 references
    multi-criteria winner determination
    0 references
    combinatorial auction
    0 references
    GRASP
    0 references
    ALNS
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references