Maximizing a class of submodular utility functions (Q543403): 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-009-0298-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109974898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location model with concave demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Independent Lifting for Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristics of Decisions in Decision Analysis Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial auctions with complement-free bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximizing welfare when utility functions are subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3244654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a discrete nonlinear and nonseparable knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2892811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity and valid inequalities in capacitated fixed charge networks / rank
 
Normal rank

Latest revision as of 05:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Maximizing a class of submodular utility functions
scientific article

    Statements

    Maximizing a class of submodular utility functions (English)
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    expected utility maximization
    0 references
    combinatorial auctions
    0 references
    competitive facility location
    0 references
    submodular function maximization
    0 references
    polyhedra
    0 references
    0 references