On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115146367, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the convergence of an algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for globally minimizing concave functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for globally minimizing a concave function over a compact convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound-outer approximation algorithm for concave minimization over a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave minimization via conical partitions and polyhedral outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable concave minimization via partial outer approximation and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic algorithms for constrained concave minimization: A unified critical survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Problems Subject to a Budget Constraint with Economies of Scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of cuts in reverse convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of local solutions for a class of nonconvex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for optimizing network flow capacity under economies of scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave Programming Applied to a Special Class of 0-1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear max—min problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / 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: Finite exact branch-and-bound algorithms for concave minimization over polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for minimum concave cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian based branch-and-bound algorithm for production-transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic local search algorithms for concave cost transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and local search algorithms for concave cost transshipment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Single-Sink Link-Installation Problem in Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank

Latest revision as of 17:10, 4 July 2024

scientific article
Language Label Description Also known as
English
On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
scientific article

    Statements

    On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (English)
    0 references
    0 references
    0 references
    25 November 2011
    0 references
    0 references
    \(N\)-dimensional polytopes
    0 references
    nonconvex programming
    0 references
    global optimization
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references