Theoretical and computational results about optimality-based domain reductions (Q288410): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: BARON / 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/s10589-015-9818-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2237869155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / 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: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of bounds on variables satisfying nonlinear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex analysis approach for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel stochastic method for solving linearly constrained concave global minimization problems / 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: Global optimization of multiplicative programs / 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: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank

Latest revision as of 01:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Theoretical and computational results about optimality-based domain reductions
scientific article

    Statements

    Theoretical and computational results about optimality-based domain reductions (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2016
    0 references
    0 references
    global optimization
    0 references
    domain reduction
    0 references
    branch-and-bound
    0 references
    0 references