Springer Science and Business Media LLC
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:
A new allocation rule for the housing market problem with ties
Springer Science and Business Media LLC - Tập 43 Số 1 - Trang 98-115 - 2022
L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
Springer Science and Business Media LLC - Tập 14 - Trang 219-227 - 2007
Let j and k be two positive integers with j≥k. An L(j,k)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between labels of any two adjacent vertices is at least j, and the difference between labels of any two vertices that are at distance two apart is at least k. The minimum range of labels over all L(j,k)-labellings of a graph G is ca...... hiện toàn bộ
A Bayesian analysis based on multivariate stochastic volatility model: evidence from green stocks
Springer Science and Business Media LLC - Tập 45 - Trang 1-14 - 2022
Green stocks are companies environmental protective and friendly. We test Green stock index in Shanghai Stock Exchange and China Securities Index as safe-havens for global investors. Suitable multivariate-SV model and Bayesian method are used to estimate the spillover effect between different assets among local and global markets. We choose multivariate volatility model because it can efficiently ...... hiện toàn bộ
An improved bound on 2-distance coloring plane graphs with girth 5
Springer Science and Business Media LLC - Tập 32 - Trang 645-655 - 2015
A vertex coloring is called
$$2$$
-distance if any two vertices at distance at most
$$2$$
fro...... hiện toàn bộ
Online k-color spanning disk problems
Springer Science and Business Media LLC - Tập 46 - Trang 1-14 - 2023
Inspired by the applications in on-demand manufacturing, we introduce the online k-color spanning disk problem, the first online model for color spanning problems to the best of our knowledge. Given a set P of n colored points in a plane, with each color chosen from a set C of
$$m \le n$$
colors, ...... hiện toàn bộ
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable
Springer Science and Business Media LLC - Tập 2 - Trang 117-188 - 1998
A fully odd K4 is a subdivision of K4 such that each of the six edges of the K4 is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K4 can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.
The min-p robust optimization approach for facility location problem under uncertainty
Springer Science and Business Media LLC - Tập 44 - Trang 1134-1160 - 2022
Improper value of the parameter p in robust constraints will result in no feasible solutions while applying stochastic p-robustness optimization approach (p-SRO) to solving facility location problems under uncertainty. Aiming at finding the lowest critical p-value of parameter p and corresponding robust optimal solution, we developed a novel robust optimization approach named as min-p robust optim...... hiện toàn bộ
The flexible blocking job shop with transfer and set-up times
Springer Science and Business Media LLC - - 2011
A game theoretic approach for pricing and advertising of an integrated product family in a duopoly
Springer Science and Business Media LLC - Tập 45 - Trang 1-26 - 2023
Product family concept predicates to a products’ group or services that derive from a common base and they have usually the same production process and physical features, in different industries. In this paper, we assume two manufacturers that produce some homogeneous product families that they want to decide upon their wholesale price and national advertising expenditure, as a new problem in the ...... hiện toàn bộ
Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks
Springer Science and Business Media LLC - - 2015
Tổng số: 1,633
- 1
- 2
- 3
- 4
- 5
- 6
- 10