Abstract
The set of particular 0-1 optimization problems solvable in polynomial time has been extended. This becomes when the coefficients of the objective function belong to the set of superincreasing or superdecreasing types of sequence. We have defined special superincreasing sequences which we call the nearest up and nearest down to the sequence (c j ) of objective function coefficients. They are applied to calculate the upper and lower bound of optimal objective function value. When the problem needs to compute the minimum of objective function with the superdecreasing sequence (c j ), two cases are considered. Firstly, we have described a type of problem when optimal solution can be obtained directly using a polynomial procedure. The second case needs two phases to calculate an optimal solution. The second phase relies on improving a feasible solution. The complexities of all the presented procedures are given.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alfonsin, R.: On variations of the subset sum problem. Discrete Applied Mathematics 81, 1–7 (1998)
Chudy, M.: Some properties of 0-1 optimization problems. In: Proceedings of the 11th International Conference on System Modelling Control (SMC), pp. 61–67. EXIT (2005)
Jenner, B.: Knapsack problems for NL. Information Processing Letters 54, 167–174 (1995)
Karloff, H.J., Ruzzo, W.L.: The iterated mod problem. Information and Computation 80, 193–204 (1989)
Koblitz, N.: A Course in Number Theory and Cryptography. Springer, New York (1994)
Martello, S., Toth, P.: An exact algorithm for two-constraint 0-1 knapsack problem. Operations Research 51, 826–835+837 (2003)
Sbihi, A.: A best first search algorithm for the multiple-choice multidimensional knapsack problem. Journal of Combinatorial Optimization 13, 337–351 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chudy, M. (2009). Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions. In: Korytowski, A., Malanowski, K., Mitkowski, W., Szymkat, M. (eds) System Modeling and Optimization. CSMO 2007. IFIP Advances in Information and Communication Technology, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04802-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-04802-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04801-2
Online ISBN: 978-3-642-04802-9
eBook Packages: Computer ScienceComputer Science (R0)