| Type de publication : |
 |
Communications avec actes |
|
| Domaine : |
|
|
|
| Titre : |
|
New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. |
|
| Auteur(s) : |
|
Egon Balas 1, Pierre Bonami ( ) 2 |
|
| Laboratoire : |
|
|
|
| Résumé : |
|
We discuss an open source implementation and preliminary computational testing of three variants of the Balas-Perregaard procedure for generating lift-and-project cuts from the original simplex tableau, two of which are new. Variant 1 is the original procedure with minor modifications. Variant 2 uses a new procedure for choosing the pivot element: After identifying the set of row candidates for an improving pivot, the pivot element (and column) is chosen by optimizing over the entries of all candidate rows. Finally, Variant 3 replaces the source row with its disjunctive modularization, and after each pivot it again modularizes the resulting source row. We report on computational results with the above three variants and their combinations on 65 MIPLIB.3 instances. |
|
Langue du texte
intégral : |
|
Anglais |
|
Date de production,
écriture : |
|
26/06/2007 |
|
|
| Titre de l'ouvrage : |
|
Integer Programming and Combinatorial Optimization |
|
| Audience : |
|
internationale |
|
| Date de publication : |
|
26/06/2007 |
|
| Volume : |
|
4513/2007 |
|
| Page, identifiant, ... : |
|
89-103 |
|
| Éditeur scientifique : |
|
Matteo Fischetti, David P. Williamson |
|
| Série/Collection : |
|
Lecture Notes in Computer Science |
|
|
| Titre de la conférence : |
|
12th International IPCO Conference |
|
| Date de la conférence : |
|
25/06/2007 |
|
| Date de la conférence (fin) : |
|
27/06/2007 |
|
| Ville : |
|
Ithaca |
|
| Pays : |
|
États-Unis |
|
|
Récupérer au format
