Results 1 to 10 of about 417,011 (184)
Statistical mechanics of the multi-constraint continuous knapsack problem [PDF]
Journal of Physics A: Mathematical and General, 1997 We apply the replica analysis established by Gardner to the multi-constraint continuous knapsack problem,which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large problem size, we
Chvátal V +12 more
core +6 more sources
Operations Research Letters, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Retsef Levi +2 more
exaly +4 more sources
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower’s Objective [PDF]
Journal of Optimization Theory and Applications, 2021 We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader’s aim is to optimize a linear objective function in the capacity
C. Buchheim +2 more
semanticscholar +4 more sources
A polyhedral study of the semi-continuous knapsack problem [PDF]
Mathematical Programming, 2013 This paper is on the inequality description of the closure of the convex hull of a knapsack constraint with variables belonging to the union of two intervals, i.e. the semi-continuous knapsack polyhedron. The authors study the inequalities of the polyhedron and use the inequalities as cuts in a branch and cut.
Ismael R. de Farias, Ming Zhao
semanticscholar +3 more sources
Binary social group optimization algorithm for solving 0-1 knapsack problem [PDF]
Decision Science Letters, 2022 In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems.
Anima Naik, Pradeep Kumar Chokkalingam
doaj +2 more sources
Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities [PDF]
SSRN Electronic Journal, 2023 We study an extension of the cardinality-constrained knapsack problem wherein each item has a concave piecewise linear utility structure (CCKP), which is motivated by applications such as resource management problems in monitoring and surveillance tasks.
M. Bai, C. Cardonha
semanticscholar +3 more sources
Pricing for customers with probabilistic valuations as a continuous knapsack problem [PDF]
Proceedings of the 8th international conference on Electronic commerce The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet - ICEC '06, 2006 In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. We show that under certain assumptions this problem can be reduced to the continuous
Michael Benisch, James Andrews, N. Sadeh
semanticscholar +2 more sources
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective [PDF]
Journal of Global Optimization, 2019 We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack and the follower chooses an optimal packing according to his own profits, which may differ from those of the leader.
C. Buchheim, Dorothee Henke
semanticscholar +7 more sources
A two-phase method for solving continuous rank-one quadratic knapsack problems [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKPs). In particular, we study the solution structure of the problem without the knapsack constraint.
S.E. Monabbati
doaj +4 more sources
Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem [PDF]
International Journal of Operations Research and Information Systems, 2016 The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable.
Briskorn, Dirk, Büther, Marcel
core +2 more sources