Primal-Dual Schema for Capacitated Covering Problems (Q3503854): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-540-68891-4_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1531390321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Facility Location: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems with Hard Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for vertex cover with hard capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Algorithms for Deterministic Inventory Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Primal-Dual Schema for Capacitated Covering Problems
scientific article

    Statements

    Primal-Dual Schema for Capacitated Covering Problems (English)
    0 references
    0 references
    0 references
    10 June 2008
    0 references

    Identifiers