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
Autores principales:	Maculan, N., De Mendonça Passini, M., De Moura Brito, J.A., Loiseau, I.
Formato:	JOUR
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:	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	todo:paper_03990559_v37_n2_p67_Maculan
record_format	dspace
spelling	todo:paper_03990559_v37_n2_p67_Maculan2023-10-03T15:34:03Z Column-generation in integer linear programming Maculan, N. De Mendonça Passini, M. De Moura Brito, J.A. Loiseau, I. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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 Maculan, N. De Mendonça Passini, M. De Moura Brito, J.A. Loiseau, I. 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.
format	JOUR
author	Maculan, N. De Mendonça Passini, M. De Moura Brito, J.A. Loiseau, I.
author_facet	Maculan, N. De Mendonça Passini, M. De Moura Brito, J.A. Loiseau, I.
author_sort	Maculan, N.
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
url	http://hdl.handle.net/20.500.12110/paper_03990559_v37_n2_p67_Maculan
work_keys_str_mv	AT maculann columngenerationinintegerlinearprogramming AT demendoncapassinim columngenerationinintegerlinearprogramming AT demourabritoja columngenerationinintegerlinearprogramming AT loiseaui columngenerationinintegerlinearprogramming
_version_	1807319796850622464

Column-generation in integer linear programming

Ejemplares similares