Zobrazeno 1 - 10 of 13 pro vyhledávání: '"Pierre Tolla"'
1
A hybrid search combining interior point methods and metaheuristics for 0-1 programming
Autor: Agnès Plateau, Dominique Tachat, Pierre Tolla
Publikováno v: International Transactions in Operational Research. 9:731-746
Our search deals with methods hybridizing interior point processes and metaheuristics for solving 0-1 linear programs. This paper shows how metaheuristics can take advantage of a sequence of interior points generated by an interior point method. Afte
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::32e09a542643e6eccbd30dc98fe84b01
https://doi.org/10.1111/1475-3995.00385
Zobrazit plný text záznamu
3
Using mathematical programming heuristics in a multicriteria network flow context
Autor: José Rui Figueira, Pierre Tolla, Halim M'Silti
Publikováno v: CIÊNCIAVITAE
Scopus-Elsevier
In this paper, we propose a local search procedure to test the robustness of a specific 'satisfying point' neighbourhood. It consists of the following steps: (1) build an indifference area around the satisfying point in the criteria space by using th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad19999bbaf0cbe11af6fa3af87ff031
https://doi.org/10.1057/palgrave.jors.2600571
Zobrazit plný text záznamu
6
An interactive multiobjective nonlinear programming procedure
Autor: Pierre Tolla, Abdelhalim M'silti
Publikováno v: European Journal of Operational Research. 64:115-125
This paper develops a method for interactive MultiObjective NonLinear Programming procedure (MONLP). It provides a detailed description of an efficient algorithm, and reports on promising computational results. It also discusses several alternative s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::257552a61c47857520f5dde5b1f50783
https://doi.org/10.1016/0377-2217(93)90012-c
Zobrazit plný text záznamu
8
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
Autor: Eric Soutif, Pierre Tolla, Dominique Quadri
In this paper we develop a branch-and-bound algorithm for solving a particular integer quadratic multi-knapsack problem. The problem we study is defined as the maximization of a concave separable quadratic objective function over a convex set of line
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed5916ff95f9429836fd3d192e19c2ce
https://hal.archives-ouvertes.fr/hal-00917814/file/cahier_260.pdf
Zobrazit plný text záznamu
9
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Autor: Dominique Quadri, Pierre Tolla, Eric Soutif
Publikováno v: Lecture Notes in Computer Science ISBN: 9783540695066
SOFSEM (1)
The separable quadratic multi-knapsack problem (QMKP) consists in maximizing a concave separable quadratic integer (non pure binary) function subject to mlinear capacity constraints. In this paper we develop a branch-and-bound algorithm to solve (QMK
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::30e873293c64689c29f7bfb04b659f73
https://doi.org/10.1007/978-3-540-69507-3_39
Zobrazit plný text záznamu
10
A Path Relinking Algorithm for the Generalized Assignment Problem
Autor: Agnès Plateau, Pierre Tolla, Laurent Alfandari
Publikováno v: Applied Optimization ISBN: 9781441954039
The Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to agents with capacity constraints. In this paper, a path relinking heuristic is proposed for the GAP. The main feature of our path relinking is that b
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e98ae6f580875feb545d3f7f9662bf35
https://doi.org/10.1007/978-1-4757-4137-7_1
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje