Maximum probabilistic all-or-nothing paths
Year of publication: |
2020
|
---|---|
Authors: | Goldberg, Noam ; Poss, Michael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 283.2020, 1 (16.5.), p. 279-289
|
Subject: | Dynamic programming | FPTAS | Integer non-linear programming | Networks | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
-
The exponomial choice model for assortment optimization : an alternative to the mnl model?
Aouad, Ali, (2023)
-
Analysis of a dynamic lot-sizing problem with production capacity constraint
Zhang, Zhicong, (2016)
- More ...
-
MINLP formulations for continuous piecewise linear function fitting
Goldberg, Noam, (2021)
-
Adaptively refined dynamic program for linear spline regression
Goldberg, Noam, (2014)
-
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
Eckstein, Jonathan, (2012)
- More ...