Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 284
Volume 284, Number 1, January 2020
- Arnab Adhikari
, Adrija Majumdar, Gaurav Gupta, Arnab Bisi:
An innovative super-efficiency data envelopment analysis, semi-variance, and Shannon-entropy-based methodology for player selection: evidence from cricket. 1-32 - Pietro Amenta, Alessio Ishizaka, Antonio Lucadamo, Gabriella Marcarelli, Vijay Vyas:
Computing a common preference vector in a complex multi-actor and multi-group decision system in Analytic Hierarchy Process context. 33-62 - Takao Asano, Yusuke Osaki:
Portfolio allocation problems between risky and ambiguous assets. 63-79 - Emre Berk, Ülkü Gürler, Saeed Poormoaied:
On the (Q, r) policy for perishables with positive lead times and multiple outstanding orders. 81-98 - Gongbing Bi, Lei Song, Yalei Fei:
Dynamic mixed-item inventory control with limited capital and short-term financing. 99-130 - Christian Billing, Florian Jaehn, Thomas Wensing:
Fair task allocation problem. 131-146 - Denis Bouyssou, Thierry Marchant, Marc Pirlot:
A characterization of two disproportionality and malapportionment indices: the Duncan and Duncan index and the Lijphart index. 147-163 - Catherine Bruneau, Alexis Flageollet, Zhun Peng:
Economic and financial risk factors, copula dependence and risk sensitivity of large multi-asset class portfolios. 165-197 - Henrik C. Bylling, Salvador Pineda, Trine Krogh Boomsma:
The impact of short-term variability and uncertainty on long-term power planning. 199-223 - Rosella Castellano, Roy Cerqueti, Giulia Rotundo:
Exploring the financial risk of a temperature index: a fractional integrated approach. 225-242 - Jingnan Chen, Gengling Dai, Ning Zhang:
An application of sparse-group lasso regularization to equity portfolio optimization and sector selection. 243-262 - Maciej Drwal, Jerzy Józefczyk:
Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times. 263-282 - Markó Horváth, Tamás Kis:
Polyhedral results for position-based scheduling of chains on a single machine. 283-322 - Jerzy Legut:
How to obtain an equitable optimal fair division. 323-332 - Luke Muggy, Jessica L. Heier Stamm:
Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms. 333-365 - Bruno C. S. Nogueira, Rian G. S. Pinheiro:
A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems. 367-400 - Sujit Kumar Samanta:
Waiting-time analysis of D- BMAP/G/1 queueing system. 401-413 - Madjid Tavana, Kaveh Khalili Damghani, Francisco J. Santos-Arteaga, Arousha Hashemi:
A Malmquist productivity index for network production systems in the energy sector. 415-445 - Barnabé Walheer:
Output, input, and undesirable output interconnections in data envelopment analysis: convexity and returns-to-scale. 447-467 - Panagiotis Xidonas, Mike G. Tsionas, Constantin Zopounidis:
On mutual funds-of-ETFs asset allocation with rebalancing: sample covariance versus EWMA and GARCH. 469-482
Volume 284, Number 2, January 2020
- Fabio Furini, Ivana Ljubic, Emiliano Traversi:
Preface: decomposition methods for hard optimization problems. 483-485 - Eduardo Álvarez-Miranda, Markus Sinnl:
A branch-and-cut algorithm for the maximum covering cycle problem. 487-499 - Saverio Basso, Alberto Ceselli, Andrea Tettamanzi:
Random sampling and machine learning to understand good decompositions. 501-526 - Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso:
Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. 527-555 - Emilia Grass, Kathrin Fischer, Antonia Rams:
An accelerated L-shaped method for solving two-stage stochastic programs in disaster management. 557-582 - Babak Saleck Pay, Yongjia Song:
Partition-based decomposition algorithms for two-stage Stochastic integer programs with continuous recourse. 583-604 - Majid Taghavi, Kai Huang:
A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints. 605-621 - Raymond G. Vickson, Elkafi Hassini, Nader Azad:
A Benders decomposition approach to product location in carousel storage systems. 623-643 - Abdelouahab Zaghrouti, Issmail El Hallaoui, François Soumis:
Improving set partitioning problem solutions by zooming around an improving direction. 645-671
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-18 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
