Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-005-2655-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978293020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approach to linear programs with several additional multiplicative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane/tabu search algorithms for low rank concave quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-relaxed dual global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition approach for the global minimization of biconcave functions over polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method for minimizing a convex-concave function over a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the convex multiplicative programming problem / 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: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of problems where dual bounds beat underestimation bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange duality and partitioning techniques in nonconvex global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounds and optimality cuts for all-quadratic programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality bound method for the general quadratic programming problem with quadratic constraints / rank
 
Normal rank

Latest revision as of 10:13, 24 June 2024

scientific article
Language Label Description Also known as
English
Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
scientific article

    Statements

    Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (English)
    0 references
    0 references
    8 February 2006
    0 references
    global optimization
    0 references
    multiplicative programming
    0 references
    branch-and-bound schemes
    0 references
    decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references