Lifted Euclidean inequalities for the integer single node flow set with upper bounds
Year of publication: |
2016
|
---|---|
Authors: | Agra, Agostinho ; Constantino, Miguel Fragoso |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 251.2016, 1 (16.5.), p. 53-63
|
Subject: | Valid inequalities | Mixed integer programming | Polyhedral description | Single node flow set | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Esmaeilbeigi, Rasul, (2016)
-
Enhanced models for a mixed arrival-departure aircraft sequencing problem
Ghoniem, Ahmed, (2014)
-
Gavranis, Andreas, (2015)
- More ...
-
A cutting plane approach to capacitated lot-sizing with start-up costs
Constantino, Miguel Fragoso, (1993)
-
Effective formulation reductions for the quadratic assignment problem
Zhang, Huizhen, (2010)
-
Strong formulation for the spot 5 daily photograph scheduling problem
Ribeiro, Glaydston Mattos, (2010)
- More ...