• Special Issue: Nonlinear Knapsack and Related Problems

Special Issue: Nonlinear Knapsack and Related Problems

Guest Editors: Andrea Lodi and Silvano Martello

 

• Deadline for submission: January 31, 2013

 

The last few years have seen an amazing increase in the interest of scientists and practitioners in combining nonlinear programming (NLP) and discrete optimization (DO) techniques to solve an impressive variety of problems. This has been possible because both NLP and DO reached a mature state of evolution, in terms of both theory and software, indicating that more challenging problems, which were considered out of reach, can now be tackled effectively.

Knapsack problems have been since the very beginning at the core of discrete optimization. Not only they are interesting in practice per se, but also they have represented an extraordinary context in which basic techniques like branching, polyhedral theory, preprocessing and approximation algorithms have been developed and then generalized to make their way into general-purpose solvers.

For these reasons, it is time to explore new challenging problems in the area of knapsack with nonlinear aspects. Problems and techniques of interest are

• quadratic knapsack;
• multi-level knapsack;
• knapsack problems with (application-oriented) side constraints;
• convex and nonconvex knapsack generalizations;
• preprocessing techniques;
• polyhedral nonlinear techniques;
• software implementations;
• application-oriented studies,

but the special issue is not restricted to those, and submissions on different problems/techniques are encouraged.

We invite papers that propose and apply new ideas to nonlinear knapsack and related problems with emphasis on algorithmic development, computational aspects, and implementations.

EURO-Online login

Username:
Password: