Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: INTOPT_90 / 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/s10898-004-2705-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103962598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for two-stage stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous global search: continuous problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677502 / 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: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NOP-2 modeling language for nonlinear programming / 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: Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic 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: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank

Latest revision as of 13:09, 11 June 2024

scientific article
Language Label Description Also known as
English
Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
scientific article

    Statements

    Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (English)
    0 references
    0 references
    0 references
    13 December 2005
    0 references
    BARON
    0 references
    First-order optimality conditions
    0 references
    Mathematical programming modeling languages
    0 references
    Pooling problem
    0 references
    Reformulation-linearization
    0 references
    Satisfiability
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers