The lexicographic α-robust knapsack problem (Q3087844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1111/j.1475-3995.2010.00786.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007620870 / 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: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: α-Reliable p-minimax regret: A new model for strategic facility location modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the applicability of MCDA to some robustness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank

Latest revision as of 10:14, 4 July 2024

scientific article
Language Label Description Also known as
English
The lexicographic α-robust knapsack problem
scientific article

    Statements

    Identifiers