Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Knapsack / 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.1111/j.1475-3995.2011.00836.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025706613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Solution for Linear Bicriteria Knapsack Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the max-min 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness in operational research and decision aiding: a multi-faceted issue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of effective heuristics and their application to a variety of knapsack problems / 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 18:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Hybrid approaches for the two-scenario max-min knapsack problem
scientific article

    Statements

    Hybrid approaches for the two-scenario max-min knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problem
    0 references
    relaxation
    0 references
    hybrid method
    0 references
    0 references
    0 references
    0 references