Basis Continuous Quadratic Knapsack Problems (CQKnP) solver based on the standard dual-ascent approach. More...

#include "CQKnPClass.h"

Classes
class	DualCQKnP
	Solver of Continuous Quadratic Knapsack Problems (CQKnP) based on the standard formulation of the dual problem as a piecewise-convex problem in the unique multiplier of the knapsack constraint and the corresponding obvious dual-ascent approach. More...

Macros
#define	DualCQKnP_WHCH_QSORT 1
	If DualCQKnP_WHCH_QSORT == 0, the sort() function of the STL is used, otherwise a hand-made non-recursive quick-sort implementation is used. More...

#define	DualCQKnP_SANITY_CHECKS 0
	If DualCQKnP_SANITY_CHECKS == 1, sanity checks are done each time the data of the instance changes to pick up clearly bad values. More...

Detailed Description

Basis Continuous Quadratic Knapsack Problems (CQKnP) solver based on the standard dual-ascent approach.

This class is restricted to instances where all items have strictly positive quadratic costs and finite bounds (both lower and upper).

Conforms to the standard interface for CQKnP solver defined by the abstract base class CQKnpClass.

Author: Antonio Frangioni
Operations Research Group
Dipartimento di Informatica
Universita' di Pisa; Enrico Gorgone
Dipartimento di Elettronica Informatica e Sistemistica
Universita' della Calabria
Copyright &copy 2011 - 2012 by Antonio Frangioni, Enrico Gorgone.

Classes