Exact and heuristic algorithms for the interval data robust assignment problem (Q632649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2010.11.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max (regret) versions of min cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / 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 Programming on Cray Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chain and filter-and-fan methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem with interval data via Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust set covering problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of Combinatorial Optimization (Till 1960) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2010.11.009 / rank
 
Normal rank

Latest revision as of 23:08, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact and heuristic algorithms for the interval data robust assignment problem
scientific article

    Statements

    Exact and heuristic algorithms for the interval data robust assignment problem (English)
    0 references
    0 references
    0 references
    25 March 2011
    0 references
    minmax regret optimization
    0 references
    interval data
    0 references
    assignment problem
    0 references
    Benders decomposition
    0 references
    genetic algorithm
    0 references
    hybrid heuristic
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers