Primal-dual schema for capacitated covering problems (Q747765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-014-0803-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964001041 / 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 unified approach to approximating resource allocation and scheduling / 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: Primal-Dual Schema for Capacitated 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: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single item lot-sizing with non-decreasing capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank

Latest revision as of 21:48, 10 July 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
    19 October 2015
    0 references
    approximation algorithms
    0 references
    primal-dual schema
    0 references
    knapsack-cover inequalities
    0 references
    lot-sizing
    0 references

    Identifiers