Multi-constrained matroidal knapsack problems (Q1824560): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a multiple-choice knapsack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical programming system for preference and compatibility maximized menu planning and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroidal knapsack: A class of (often) well-solvable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Models for Sales Resource Allocation / rank
 
Normal rank

Latest revision as of 11:00, 20 June 2024

scientific article
Language Label Description Also known as
English
Multi-constrained matroidal knapsack problems
scientific article

    Statements

    Multi-constrained matroidal knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-constrained knapsack problems
    0 references
    combinatorial constraints of matroidal nature
    0 references
    Lagrangean relaxation
    0 references
    approximate solutions
    0 references