Learning in combinatorial optimization : what and how to explore
Year of publication: |
2020
|
---|---|
Authors: | Modaresi, Sajad ; Sauré, Denis ; Vielma, Juan Pablo |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 5, p. 1585-1604
|
Subject: | combinatorial optimization | multiarmed bandit | mixed-integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
Naderi, Bahman, (2020)
-
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
Bendotti, Pascale, (2021)
-
Solving the type-2 assembly line balancing with setups using logic-based benders decomposition
Zohali, Hassan, (2022)
- More ...
-
A dynamic clustering approach to data-driven assortment personalization
Bernstein, Fernando, (2019)
-
Learning in Combinatorial Optimization : What and How to Explore
Modaresi, Sajad, (2021)
-
Ellipsoidal methods for adaptive choice-based conjoint analysis
Sauré, Denis, (2019)
- More ...