On Lagrangian Relaxation and Subset Selection Problems (Q3602837): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1512.06736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation in Bounded Degree Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation algorithms for maximum general assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Approximating Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation and Subset Selection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling with a budget / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank

Latest revision as of 01:17, 29 June 2024

scientific article
Language Label Description Also known as
English
On Lagrangian Relaxation and Subset Selection Problems
scientific article

    Statements

    On Lagrangian Relaxation and Subset Selection Problems (English)
    0 references
    0 references
    0 references
    12 February 2009
    0 references

    Identifiers