A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462): 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/s10107-009-0274-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054365069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Resource Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pegging algorithm for the nonlinear resource allocation problem / 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: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization algorithm for a penalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic programming with one constraint and bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic ordering decisions with market choice flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuous-time single-sourcing problem with capacity expansion opportunities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a discrete nonlinear and nonseparable knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of concave knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of complete global optimization solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New and Efficient Algorithm for a Class of Portfolio Selection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the solution of quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a nonseparable convex maximization problem with continuous Knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex-inspired algorithms for solving a class of convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Choice Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target market selection and marketing effort under uncertainty: the selective newsvendor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warehouse-Retailer Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Latest revision as of 18:10, 3 July 2024

scientific article
Language Label Description Also known as
English
A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
scientific article

    Statements

    A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2011
    0 references
    0 references
    0 references

    Identifiers

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