Dynamic Knapsack Sets and Capacitated Lot-Sizing.
| Year of publication: |
2000
|
|---|---|
| Authors: | Loparic, M. ; Marchand, H. ; Wolsey, L.A. |
| Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
| Subject: | COSTS | LOT-SIZING | INEQUALITIES |
-
A Branch-and-Cut Algorithm for the Single Commodity Uncapacitated Fixed Charge Network Flow Problem.
Ortega, F., (2000)
-
Dual labour markets, minimum wage, inequalities
Lewandowski, Piotr, (2014)
-
Daughters and Left Wing Voting
Oswald, A, (2008)
- More ...
-
The Uncapacitated Lot-Sizing Problem with Sales and Safety Shocks.
Loparic, M., (1999)
-
Aggregation and Mixed Integer Rounding to Solve MIPs.
Marchand, H., (1998)
-
bc-opt: A Branch-and-Cut Code for Mixed Integer Programs.
Cordier, C., (1997)
- More ...