Product line optimization with multiples sites
Year of publication: |
2022
|
---|---|
Authors: | Dávila, Sebastián ; Labbé, Martine ; Marianov, Vladimir ; Ordóñez, Fernando ; Semet, Frédéric |
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. 148.2022, p. 1-14
|
Subject: | Location | Product allocation to multiple stores | Bilevel programming | Cut and Branch | Branch and Cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
An enhanced branch-and-bound algorithm for bilevel integer linear programming
Liu, Shaonan, (2021)
-
An exact cutting plane method for the Euclidean max-sum diversity problem
Spiers, Sandy, (2023)
-
An exact algorithm for the reliability redundancy allocation problem
Caserta, Marco, (2015)
- More ...
-
Playing Stackelberg Security Games in perfect formulations
Bustamante-Faúndez, Pamela, (2024)
-
A Mixed-Integer Optimization Formulation for Buyers Formation
Dávila-Gálvez, Sebastián, (2023)
-
A study of general and security Stackelberg game formulations
Casorrán, Carlos, (2019)
- More ...