Valid inequalities and separation algorithms for the set partitioning problem
Year of publication: |
November 2014
|
---|---|
Authors: | Groiez, Mounira ; Desaulniers, Guy ; Marcotte, Odile |
Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 121260-6. - Vol. 52.2014, 4, p. 185-196
|
Subject: | set partitioning | cutting planes | rank-1 Chvátal-Gomory inequalities | clique | separation algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Einkommensverteilung | Income distribution |
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
- More ...
-
Groiez, Mounira, (2013)
-
Dispatching Buses in a Depot Using Block Patterns
Hamdouni, Mohamed, (2006)
-
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
Hadjar, Ahmed, (2006)
- More ...