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í |
| LEADER | 03166caa a22004937a 4500 | ||
|---|---|---|---|
| 001 | PAPER-14101 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518204434.0 | ||
| 008 | 190411s2014 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-84926471838 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Loiseau, I. | |
| 245 | 1 | 0 | |a Column Generation in Integer Linear Programming |
| 260 | |b Wiley Blackwell |c 2014 | ||
| 270 | 1 | 0 | |m Loiseau, I.; Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos AiresArgentina |
| 506 | |2 openaire |e Política editorial | ||
| 520 | 3 | |a 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. |l eng | |
| 593 | |a Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina | ||
| 593 | |a Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, Italy | ||
| 593 | |a Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Brazil | ||
| 593 | |a Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, Italy | ||
| 690 | 1 | 0 | |a COLUMN GENERATION |
| 690 | 1 | 0 | |a INTEGER LINEAR PROGRAM (ILP) |
| 690 | 1 | 0 | |a VEHICLE ROUTING |
| 690 | 1 | 0 | |a BRANCH AND PRICE |
| 690 | 1 | 0 | |a COLUMN GENERATION |
| 690 | 1 | 0 | |a EXACT METHODS |
| 690 | 1 | 0 | |a INTEGER LINEAR PROGRAMMING |
| 690 | 1 | 0 | |a INTEGER LINEAR PROGRAMS |
| 690 | 1 | 0 | |a IT FOCUS |
| 690 | 1 | 0 | |a LINEAR RELAXATIONS |
| 690 | 1 | 0 | |a VEHICLE ROUTING PROBLEMS |
| 690 | 1 | 0 | |a INTEGER PROGRAMMING |
| 700 | 1 | |a Ceselli, A. | |
| 700 | 1 | |a Maculan, N. | |
| 700 | 1 | |a Salani, M. | |
| 773 | 0 | |d Wiley Blackwell, 2014 |g v. 9781848216563 |h pp. 235-259 |p Concepts of Comb. Optim.: 2nd Ed. |z 9781119005216 |z 9781848216563 |t Concepts of Combinatorial Optimization: 2nd Edition | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84926471838&doi=10.1002%2f9781119005216.ch9&partnerID=40&md5=a50362a9af995dff624e96865c1eaf06 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1002/9781119005216.ch9 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_97811190_v9781848216563_n_p235_Loiseau |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97811190_v9781848216563_n_p235_Loiseau |y Registro en la Biblioteca Digital |
| 961 | |a paper_97811190_v9781848216563_n_p235_Loiseau |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/bookPart |a info:ar-repo/semantics/parte de libro |b info:eu-repo/semantics/publishedVersion | ||
| 999 | |c 75054 | ||