Top
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
On simulating arbitrary events
Top - Tập 11 - Trang 131-140 - 2003
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...
A simple and effective algorithm for the maximum happy vertices problem
Top - - 2022
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 approach is based on simple ingredients implying as
startin...
An economic order quantity model with partial backlogging under general backorder cost function
Top - Tập 17 Số 2 - Trang 366-384 - 2009
An integrated inventory model with quality improvement and two-part credit policy
Top - Tập 22 - Trang 1042-1061 - 2014
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...
A note on assignment games with the same nucleolus
Top - Tập 27 - Trang 187-198 - 2019
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 problem
Top - Tập 30 - Trang 60-76 - 2021
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...
Infimal convolution, c-subdifferentiability, and Fenchel duality in evenly convex optimization
Top - - 2011
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...
Tổng số: 627
- 1
- 2
- 3
- 4
- 5
- 6
- 10