Supermodular covering knapsack polytope (Q1751131): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Atamtürk, Alper / rank
Normal rank
 
Property / author
 
Property / author: Atamtürk, Alper / 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.1016/j.disopt.2015.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148870598 / 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: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover and pack inequalities for (mixed) integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The submodular knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting for conic 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: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach / 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: The nonlinear knapsack problem - algorithms and applications / 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: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Term Disjunctions on the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split cuts and extended formulations for mixed integer conic quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Nonlinear Knapsack Problems / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Supermodular covering knapsack polytope
scientific article

    Statements

    Supermodular covering knapsack polytope (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    conic integer programming
    0 references
    supermodularity
    0 references
    lifting
    0 references
    probabilistic covering knapsack constraints
    0 references
    branch-and-cut algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references