A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2020.1006 / 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.1287/ijoc.2020.1006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3118849442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support Vector Ordinal Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERT and crashing revisited: Mathematical generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Joint Vehicle Routing and Speed Optimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimum Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic approach for the pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations for utilizing separability when solving convex MINLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Two Different Aspects of the Representative Method: The Method of Stratified Sampling and the Method of Purposive Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation problems in decentralized energy management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Algorithm for Nested Resource Allocation Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2020.1006 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7548833
Language Label Description Also known as
English
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
scientific article; zbMATH DE number 7548833

    Statements

    A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2022
    0 references
    resource allocation
    0 references
    constraint relaxation
    0 references
    divide and conquer
    0 references
    polynomial-time algorithms
    0 references
    mixed integer convex optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers