Column Generation in Integer Linear Programming
This chapter introduces exact methods for solving integer linear programming problems with a large number of variables. These methods are known as branch-and price methods. The chapter examines an inequality for eliminating 0-1 column generation and it focuses on two integer linear programming probl...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
Wiley Blackwell
2014
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| Sumario: | This chapter introduces exact methods for solving integer linear programming problems with a large number of variables. These methods are known as branch-and price methods. The chapter examines an inequality for eliminating 0-1 column generation and it focuses on two integer linear programming problem models and a comparison between their linear relaxations. The chapter presents a schema of a column generation method for solving an integer linear programming (ILP) and the difficulties that can appear at the time of implementation. In the chapter two column generation algorithms are introduced: for the p-medians problem and for vehicle routing problems. © ISTE Ltd 2014. All rights reserved. |
|---|---|
| ISBN: | 9781119005216 9781848216563 |
| DOI: | 10.1002/9781119005216.ch9 |