Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yakov M. Shafransky / rank
Normal rank
 
Property / author
 
Property / author: Yakov M. Shafransky / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6624263 / rank
 
Normal rank
Property / zbMATH Keywords
 
Lawler's minmax cost algorithm
Property / zbMATH Keywords: Lawler's minmax cost algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
uncertainty
Property / zbMATH Keywords: uncertainty / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum regret
Property / zbMATH Keywords: maximum regret / 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/s10951-014-0413-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017972746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of late jobs on a single machine under due date uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine scheduling problems under scenario-based uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions of optimality for some classical scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5826088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ordered weighted averaging aggregation operators in multicriteria decisionmaking / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Lawler's minmax cost algorithm: optimality conditions and uncertainty
scientific article

    Statements

    Lawler's minmax cost algorithm: optimality conditions and uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    Lawler's minmax cost algorithm
    0 references
    uncertainty
    0 references
    maximum regret
    0 references

    Identifiers