Result: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
Title:
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
Authors:
Source:
International Symposium on Combinatorial Optimization CO'02Discrete applied mathematics. 154(15):2200-2211
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme, Algorithm, Algoritmo, Borne inférieure, Lower bound, Cota inferior, Convergence, Convergencia, Informatique théorique, Computer theory, Informática teórica, Optimisation, Optimization, Optimización, Problème sac à dos, Knapsack problem, Problema mochila, Recherche locale, Local search, Busca local, Algorithme sous gradient, Subgradient algorithm, Heuristique, Relaxation lagrangéenne, Lagrangean relaxation, Réoptimisation, Reoptimization, 0-1 Knapsack
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire d'Informatique de Paris Nord, UMR CNRS 7030, Université de Paris 13, 99, avenue Jean-Baptiste Clément, 93430 Villetaneuse, France
ISSN:
0166-218X
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.18159574
Database:
PASCAL Archive
Further Information
First, this paper deals with lagrangean heuristics for the 0-1 bidimensional knapsack problem. A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced by lagrangean heuristics. Thirdly, a variable fixing phase is embedded in the process. Finally, the sequence of 0-1 one-dimensional knapsack instances obtained from the algorithm are solved by using reoptimization techniques in order to reduce the total computational time effort. Computational results are presented.