Partial objective inequalities for the multi-item capacitated lot-sizing problem
Year of publication: |
March 2018
|
---|---|
Authors: | Büyüktahtakın, İ. Esra ; Smith, J. Cole ; Hartman, Joseph C. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 91.2018, p. 132-144
|
Subject: | Mixed-integer programming | Dynamic programming | Cutting planes | Valid inequalities | Partial objective cuts | (l, S) inequalities | Polyhedral study | Branch-and-cut | Multi-item | Capacitated lot-sizing | Production planning | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Produktionsplanung | Losgröße | Lot size | Produktionssteuerung | Production control | Ganzzahlige Optimierung | Integer programming | Einkommensverteilung | Income distribution | Dynamische Optimierung |
-
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems : zero setup case
Doostmohammadi, Mahdi, (2018)
-
Kwak, Ik-soon, (2011)
-
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
Gicquel, C., (2015)
- More ...
-
Parallel asset replacement problem under economies of scale with multiple challengers
Büyüktahtakın, İ. Esra, (2014)
-
A mixed-integer programming approach to the parallel replacement problem under technological change
Büyüktahtakın, İ. Esra, (2016)
-
Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
Büyüktahtakın, İ. Esra, (2023)
- More ...