Sequence independent lifting for a set of submodular maximization problems (Q2097631): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-022-01801-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
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/s10107-022-01801-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4224259771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting for mixed knapsack problems with GUB constraints / 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: Maximizing a Class of Utility Functions Over the Vertices of a Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The submodular knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / 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: Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / 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: 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: Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Independent Lifting for the Set of Submodular Maximization Problem / 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
Property / cites work
 
Property / cites work: A two-stage stochastic programming approach for influence maximization in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing expected utility over a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for a class of cardinality constrained submodular minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-022-01801-Y / rank
 
Normal rank

Latest revision as of 01:25, 17 December 2024

scientific article
Language Label Description Also known as
English
Sequence independent lifting for a set of submodular maximization problems
scientific article

    Statements

    Sequence independent lifting for a set of submodular maximization problems (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2022
    0 references
    submodular function maximization
    0 references
    sequence-independent lifting
    0 references
    polyhedra
    0 references
    multidimentional lifting
    0 references
    mixed 0-1 knapsack
    0 references
    0 references
    0 references
    0 references

    Identifiers