On interval-subgradient and no-good cuts (Q613320): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q118165472, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility-Based Bounds Tightening via Fixed Points / 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: Global optimization problems and domain reduction strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for disjunctive convex optimization / 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: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based branching schemes for binary linear mixed integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding-based heuristics for nonconvex MINLPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation and decomposition methods for mixed integer nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting inequalities: a framework for generating strong cuts for nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval analysis on directed acyclic graphs for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of fractional programs via novel convexification techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank

Revision as of 13:40, 3 July 2024

scientific article
Language Label Description Also known as
English
On interval-subgradient and no-good cuts
scientific article

    Statements

    On interval-subgradient and no-good cuts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    interval-gradient/subgradient cuts
    0 references
    no-good cuts
    0 references
    nondifferentiable functions
    0 references
    0 references
    0 references
    0 references

    Identifiers