Column-generation in integer linear programming

Mostrar todas las versiones(3)

We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in ord...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Loiseau, Irene
Publicado:	2003
Materias:	Branch-and-price Column-generation Integer programming Binary sequences Computational geometry Computational methods Problem solving Telecommunication networks Vectors Binary column vectors Column generation Integer linear programming Integer problems Linear programming
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03990559_v37_n2_p67_Maculan http://hdl.handle.net/20.500.12110/paper_03990559_v37_n2_p67_Maculan
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_03990559_v37_n2_p67_Maculan
record_format	dspace
spelling	paper:paper_03990559_v37_n2_p67_Maculan2023-06-08T15:41:05Z Column-generation in integer linear programming Loiseau, Irene Branch-and-price Column-generation Integer programming Binary sequences Computational geometry Computational methods Integer programming Problem solving Telecommunication networks Vectors Binary column vectors Column generation Integer linear programming Integer problems Linear programming We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem. © EDP Sciences 2003. Fil:Loiseau, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2003 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03990559_v37_n2_p67_Maculan http://hdl.handle.net/20.500.12110/paper_03990559_v37_n2_p67_Maculan
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Branch-and-price Column-generation Integer programming Binary sequences Computational geometry Computational methods Integer programming Problem solving Telecommunication networks Vectors Binary column vectors Column generation Integer linear programming Integer problems Linear programming
spellingShingle	Branch-and-price Column-generation Integer programming Binary sequences Computational geometry Computational methods Integer programming Problem solving Telecommunication networks Vectors Binary column vectors Column generation Integer linear programming Integer problems Linear programming Loiseau, Irene Column-generation in integer linear programming
topic_facet	Branch-and-price Column-generation Integer programming Binary sequences Computational geometry Computational methods Integer programming Problem solving Telecommunication networks Vectors Binary column vectors Column generation Integer linear programming Integer problems Linear programming
description	We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem. © EDP Sciences 2003.
author	Loiseau, Irene
author_facet	Loiseau, Irene
author_sort	Loiseau, Irene
title	Column-generation in integer linear programming
title_short	Column-generation in integer linear programming
title_full	Column-generation in integer linear programming
title_fullStr	Column-generation in integer linear programming
title_full_unstemmed	Column-generation in integer linear programming
title_sort	column-generation in integer linear programming
publishDate	2003
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03990559_v37_n2_p67_Maculan http://hdl.handle.net/20.500.12110/paper_03990559_v37_n2_p67_Maculan
work_keys_str_mv	AT loiseauirene columngenerationinintegerlinearprogramming
_version_	1768545512805367808

Column-generation in integer linear programming

Ejemplares similares