On simulating arbitrary eventsTop - Tập 11 - Trang 131-140 - 2003
Marcel F. Neuts, Jun Guo
In simulation studies, the distributional properties of random variables associated witharbitrary events in point processes, queues, and other stochastic models are to be understood as appropriate averages over long simulation runs. We caution against trying to generate arbitrary events explicitly by some randomized selection. Because of the likelihood of hidden selection biases, that easily resul...... hiện toàn bộ
A simple and effective algorithm for the maximum happy vertices problemTop - - 2022
Marco Ghirardi, Fabio Salassa
AbstractIn a recent paper, a solution approach to the Maximum Happy Vertices Problem has been proposed. The approach is based on a constructive heuristic improved by a matheuristic local search phase. We propose a new procedure able to outperform the previous solution algorithm both in terms of solution quality and computational time. Our...... hiện toàn bộ
An integrated inventory model with quality improvement and two-part credit policyTop - Tập 22 - Trang 1042-1061 - 2014
Liang-Yuh Ouyang, Cheng-Ju Chuang, Chia-Huei Ho, Chien-Wei Wu
Trade credit financing plays a vital role in current business operations. Vendors extend payment dates to encourage sales, and buyers are not required to pay immediately after receiving products. This is equivalent to receiving a price reduction. Besides, buyers reduce their need for capital from bank loans. In addition, a number of defective products are produced during the production process. Th...... hiện toàn bộ
A note on assignment games with the same nucleolusTop - Tập 27 - Trang 187-198 - 2019
F. Javier Martínez-de-Albéniz, Carlos Rafels, Neus Ybern
We show that the family of assignment matrices which give rise to the same nucleolus forms a compact join-semilattice with one maximal element. The above family is, in general, not a convex set, but path-connected.
The target visitation arc routing problemTop - Tập 30 - Trang 60-76 - 2021
Jessica Rodríguez-Pereira, Gilbert Laporte
This paper studies the target visitation arc routing problem on an undirected graph. This problem combines the well-known undirected rural postman problem and the linear ordering problem. In this problem, there is a set of required edges partitioned into targets, which must be traversed and there are pairwise preferences for the order in which some targets are serviced, which generates a revenue i...... hiện toàn bộ
Infimal convolution, c-subdifferentiability, and Fenchel duality in evenly convex optimizationTop - - 2011
M. D. Fajardo, J. Vicente-Pérez, M. M. L. Rodríguez
In this paper we deal with strong Fenchel duality for infinite-dimensional optimization problems where both feasible set and objective function are evenly convex. To this aim, via perturbation approach, a conjugation scheme for evenly convex functions, based on generalized convex conjugation, is used. The key is to extend some well-known results from convex analysis, involving the sum of the epigr...... hiện toàn bộ