AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiao Jin Zheng / rank
Normal rank
 
Property / author
 
Property / author: Xiao Jin Zheng / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertain convex programs: randomized solutions and confidence levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scenario Approach to Robust Control Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixing sets arising in chance-constrained programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming approaches for generating \(p\)-efficient points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for linear programs with probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Approximations of Chance Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Bounds on Probabilities Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations for probabilistically constrained programs with discrete random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:05, 6 July 2024

scientific article
Language Label Description Also known as
English
AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS
scientific article

    Statements

    AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    stochastic programming
    0 references
    chance-constrained quadratic knapsack problem
    0 references
    finite discrete distribution
    0 references
    convex 0-1 quadratic program reformulation
    0 references
    SDP formulation
    0 references
    0 references