Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Reductions in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound reduction using pairs of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multi-commodity flow formulations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities for the Pooling Problem with Binary Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint aggregation for rigorous global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: QPLIB: a library of quadratic programming instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three enhancements for optimization-based bound tightening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and discretizations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain reduction techniques for global NLP and MINLP optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for global minimization of separable concave programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation, relational arithmetic in AI systems and mathematical programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank

Revision as of 04:32, 30 July 2024

scientific article; zbMATH DE number 7587558
Language Label Description Also known as
English
Variable Bound Tightening and Valid Constraints for Multiperiod Blending
scientific article; zbMATH DE number 7587558

    Statements

    Variable Bound Tightening and Valid Constraints for Multiperiod Blending (English)
    0 references
    0 references
    0 references
    19 September 2022
    0 references
    preprocessing
    0 references
    reformulation-linearization technique
    0 references
    variable lifting
    0 references
    bilinear terms
    0 references
    0 references
    0 references
    0 references

    Identifiers