运筹学和管理学研究协会
期刊
会议
图书
作者:Yuji Shinano , Stefan Heinz , Stefan Vigerske ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2018, Vol.30 (1)INFORMS
摘要:Recently, parallel computing environments have become significantly popular. In order to obtain the benefit of using parallel computing environments, we have to deploy our programs for these effectively. This paper focuses on a parallelization of SCIP (Solving Constraint Integer ...
作者:Qi-Ming He , Attahiru Sule Alfa
来源:[J].INFORMS Journal on Computing(IF 1.37), 2018, Vol.30 (1)INFORMS
摘要:In this paper, we present examples of a class of Markov chains that occur frequently, but whose associated matrices are a challenge to construct efficiently. These are Markov chains that arise as a result of several identical Markov chains running in parallel. Specifically for th...
作者:Ashwin Arulselvan , Mohsen Rezapour , Wolfgang A. Welz
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:We study a problem that integrates buy-at-bulk network design into the classical facility location problem. We consider a generalization of the facility location problem where multiple clients may share a capacitated network to connect to open facilities instead of requiring dire...
作者:Juliane Müller
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:We present the algorithm SOCEMO for optimization problems that have multiple conflicting computationally expensive black-box objective functions. The computational expense arising from the objective function evaluations considerably restricts the number of evaluations that c...
作者:Jens Hübner , Martin Schmidt , Marc C. Steinbach
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:Multistage stochastic optimization leads to NLPs over scenario trees that become extremely large when many time stages or fine discretizations of the probability space are required. Interior-point methods are well suited for these problems if the arising huge, structured KKT...
作者:Bjorn P. Berg , Brian T. Denton
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:This paper presents a new model for online decision making. Motivated by the healthcare delivery application of dynamically allocating patients to procedure rooms in outpatient procedure centers, the online stochastic extensible bin-packing problem is described. The objectiv...
作者:Kathryn M. Schumacher , Amy E. M. Cohn , Richard Li-Yang Chen
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:Most power grid systems are operated to be N -1 secure, meaning that the system can withstand the failure of any one component. There is increasing interest in more stringent security standards, where the power grid must be able to survive the (nearly) simultaneous failure o...
作者:Baojun Ma , Qiang Wei , Guoqing Chen ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:Recent years have witnessed a rapid increase in online data volume and the growing challenge of information overload for web use and applications. Thus, information diversity is of great importance to both information service providers and users of search services. Based on ...
作者:Alexandre Domingues Gonçalves , Artur Alves Pessoa , Cristiana Bentes ...
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:The quadratic assignment problem (QAP) is a combinatorial optimization problem that arises in many real-world applications, such as equipment allocation in industry. The QAP is NP-hard and, in practice, one of the hardest combinatorial optimization problems to solve to optim...
作者:Benjamin C. Shelbourne , Maria Battarra , Chris N. Potts
来源:[J].INFORMS Journal on Computing(IF 1.37), 2017, Vol.29 (4)INFORMS
摘要:A novel extension of the classical vehicle routing and scheduling problems is introduced that integrates aspects of machine scheduling into vehicle routing. Associated with each customer order is a release date that defines the earliest time that the order is available to leave t...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×