Displaying similar documents to “Contents of volume 35 issue 3”

Integer Programming Formulation of the Bilevel Knapsack Problem

R. Mansi, S. Hanafi, L. Brotcorne (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...

A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

Teodros Getachew, Michael Kostreva, Laura Lancaster (2010)

RAIRO - Operations Research

Similarity:

The Algorithm in this paper is designed to find the shortest path in a network given time-dependent cost functions. It has the following features: it is recursive; it takes place bath in a backward dynamic programming phase and in a forward evaluation phase; it does not need a time-grid such as in Cook and Halsey and Kostreva and Wiecek's "Algorithm One”; it requires only boundedness (above and below) of the cost functions; it reduces to backward multi-objective dynamic programming...