From Cost Sharing Mechanisms to Online Selection Problems (Q3449447): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2119875938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case performance for lot sizing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Robust Revenue Management: Competitive Analysis of Online Booking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New efficiency results for makespan cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Sharing Methods for Makespan and Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Management with Online Customer Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio for online facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requirements Planning with Pricing and Order Selection Flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for supply chain planning and logistics problems with market choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / 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: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online traveling salesman problems with rejection options / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable cost allocations via primal-dual-type algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental cost sharing: Characterization by coalition strategy-proofness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategyproof sharing of submodular costs: budget balance versus efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game-theoretic analysis of cooperation among supply chain agents: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn)-Competitive Algorithm for Online Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trade-offs in cost-sharing mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Efficiency Guarantees for Network Design Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated market selection and production planning: complexity and solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Distribution-Free Profit Maximization: The Inventory Management Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cost-sharing method for an economic lot-sizing game / rank
 
Normal rank

Latest revision as of 00:08, 11 July 2024

scientific article
Language Label Description Also known as
English
From Cost Sharing Mechanisms to Online Selection Problems
scientific article

    Statements

    From Cost Sharing Mechanisms to Online Selection Problems (English)
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    competitive ratio
    0 references
    cooperative game theory
    0 references
    facility location
    0 references
    customer selection
    0 references
    lot sizing
    0 references
    online algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references