Have a personal or library account? Click to login
The Two-Constraint Binary Knapsack Problem’s average case analysis for constraints with small, moderate and large coefficients Cover

The Two-Constraint Binary Knapsack Problem’s average case analysis for constraints with small, moderate and large coefficients

Control and Cybernetics
Volume 54 (2025): Issue 2 (June 2025)
By: Krzysztof Szkatuła  
Open Access
|Dec 2025

Authors

Krzysztof Szkatuła

Krzysztof.Szkatula@ibspan.waw.pl

Systems Research Institute, Polish Academy of Sciences ul, Warszawa, Poland
DOI: https://doi.org/10.2478/candc-2025-0007 | Journal eISSN: 2720-4278 | Journal ISSN: 0324-8569
Journal RSS Feed
Language: English
Page range: 205 - 221
Submitted on: Oct 1, 2025
|
Accepted on: Nov 1, 2025
|
Published on: Dec 21, 2025
Published by: Systems Research Institute Polish Academy of Sciences
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
combinatorial optimization,
knapsack problems,
probabilistic analysis,
Lagrange function,
Lagrange multipliers,
constraint activity
Related subjects:
Computer sciences,
Computer sciences, other,
Engineering,
Electrical engineering,
Fundamentals of electrical engineering,
Mechanical engineering,
Fundamentals of mechanical engineering,
Mathematics,
General mathematics

© 2025 Krzysztof Szkatuła, published by Systems Research Institute Polish Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 54 (2025): Issue 2 (June 2025)Next article