Narrow search
Showing 1 - 10 of 200
Cover Image
Internet shopping with price sensitive discounts
Błażewicz, Jacek; Bouvry, Pascal; Kovalyov, Mikhail Y.; … - In: 4OR : a quarterly journal of operations research 12 (2014) 1, pp. 35-48
Persistent link: https://www.econbiz.de/10010339179
Cover Image
Novel dual discounting functions for the Internet shopping optimization problem : new algorithms
Błażewicz, Jacek; Cheriere, Nathanael; Dutot, … - In: Journal of scheduling 19 (2016) 3, pp. 245-255
Persistent link: https://www.econbiz.de/10011509125
Cover Image
Minimizing the number of workers in a paced mixed-model assembly line
Delorme, Xavier; Dolgui, Alexandre; Kovalev, Sergey; … - In: European journal of operational research : EJOR 272 (2019) 1, pp. 188-194
Persistent link: https://www.econbiz.de/10011941822
Cover Image
Computational complexity in additive hedonic games
Sung, Shao Chin; Dimitrov, Dinko - 2008
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://www.econbiz.de/10003951586
Cover Image
Set-portfolio selection with the use of market stochastic bounds
Lozza, Sergio Ortobelli; Angelelli, Enrico; Toninelli, … - In: Emerging markets finance & trade : a journal of the … 47 (2011), pp. 5-24
Persistent link: https://www.econbiz.de/10009533022
Cover Image
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
Choi, Byung-Cheon; Park, Myoung-Ju - In: European journal of operational research : EJOR 244 (2015) 3, pp. 748-752
Persistent link: https://www.econbiz.de/10011289944
Cover Image
The bottleneck transportation problem with auxiliary resources
Waldherr, Stefan; Poppenberg, Jens; Knust, Sigrid - In: 4OR : a quarterly journal of operations research 13 (2015) 3, pp. 279-292
Persistent link: https://www.econbiz.de/10011347897
Cover Image
A note on the Shapley value for characteristic functions on bipartitions
Muns, Sander - 2011
Persistent link: https://www.econbiz.de/10009720756
Cover Image
The three-dimensional matching problem in Kalmanson matrices
Polyakovskiy, Sergey; Spieksma, Frits C. R.; Woeginger, … - In: Journal of combinatorial optimization 26 (2013) 1, pp. 1-9
Persistent link: https://www.econbiz.de/10009757313
Cover Image
Calculation of stability radii for combinatorial optimization problems
Chakravarti, Nilotpal; Wagelmans, Albert P. M. - 1997
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …
Persistent link: https://www.econbiz.de/10010361654