I t is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in nc time, where n is the number of items and c is the capacity of the knapsack. The quadratic knapsack problem, on the other hand, is NP -hard in the strong sense, which makes it unlikely that it can be solved in pseudo-polynomial time. We show, however, that the dynamic programming approach to the linear knapsack problem can be modified to yield a highly effective constructive heuristic for the quadratic version. In our experiments, the lower bounds obtained by our heuristic were consistently within a fraction of a percent of optimal. Moreover, the addition of a simple local search step enabled us to obtain the optimal solution of all instances considered.
A key feature of trajectory based operations (TBO)-a new concept developed to modernize the air traffic system-is the inclusion of preferences and priorities of the air traffic management (ATM) stakeholders. In this paper, we present a new mathematical model to optimize flights' 4D-trajectories. This is a multi-objective binary integer programming (IP) model, which assigns a 4D-trajectory to each flight, while explicitly modeling priorities and highlighting the trade off involved with the Airspace Users (AUs) preferences. The scope of the model (to be used at pre-tactical level) is the computation of optimal 4D pre-departure trajectory for each flight to be shared or negotiated with other stakeholders and subsequently managed throughout the flight. These trajectories are obtained by minimising the deviation (delay and rerouting) from the original preferred 4D-trajectories as well as minimizing the air navigation service (ANS) charges subject to the constraints of the system. Computational results for the model are presented, which show that the proposed model has the ability to identify trade-offs between the objectives of the stakeholders of the ATM system under the TBO concept. This can therefore provide the ATM stakeholders with useful decision tools to choose a trajectory for each flight.
The Quadratic Knapsack Problem (QKP) is a well-known N P-hard combinatorial optimisation problem, with many practical applications. We present a 'cut-and-branch' algorithm for the QKP, in which a cutting-plane phase is followed by a branch-and-bound phase. The cutting-plane phase is more sophisticated than the existing ones in the literature, incorporating several classes of cutting planes, two primal heuristics, and several rules for eliminating variables and constraints. Computational results show that the algorithm is competitive.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.