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:
Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
Springer Science and Business Media LLC - - 2018
A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
Springer Science and Business Media LLC - Tập 13 - Trang 23-34 - 2018
This paper considers a conceptual version of a convex optimization algorithm which is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated projection onto the epigraph of conjugate function. Whilst the projection problem is not exactly solvable in finite space-time it can be approximately solved up t...... hiện toàn bộ
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
Springer Science and Business Media LLC - - 2015
Best proximity point theorems on partially ordered sets
Springer Science and Business Media LLC - Tập 7 - Trang 1035-1043 - 2012
The main purpose of this article is to address a problem that amalgamates approximation and optimization in the setting of a partially ordered set that is endowed with a metric. Indeed, if A and B are non-void subsets of a partially ordered set that is equipped with a metric, and S is a non-self mapping from A to B, this paper scrutinizes the existence of an optimal approximate solution, called a ...... hiện toàn bộ
Optimality conditions in convex optimization with locally Lipschitz constraints
Springer Science and Business Media LLC - Tập 13 - Trang 1059-1068 - 2018
In this paper, we consider a convex optimization problem with locally Lipschitz inequality constraints. The KKT optimality conditions (both necessary and sufficient) for quasi
$$\epsilon $$
-solutions are established under Slater’s constraint qual...... hiện toàn bộ
An intractability result for the vertex 3-colourability problem
Springer Science and Business Media LLC - Tập 16 - Trang 1403-1409 - 2022
The vertex 3-colourability problem is to decide whether the vertex set of a given graph can be split into three subsets of pairwise non-adjacent vertices. This problem is known to be NP-complete in a certain class of graphs, defined by an explicit description of allowed 5-vertex induced subgraphs in them. In the present paper, we improve this result by showing that the vertex 3-colourability probl...... hiện toàn bộ
A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
Springer Science and Business Media LLC - Tập 14 - Trang 1747-1763 - 2019
We propose a new large-step primal-dual second-order corrector interior-point method for linear optimization. At each iteration, our method uses the new wide neighborhood introduced by Darvay and Takács (Cent Eur J Oper Res 26(3):551–563, 2018.
https://doi.org/10.1007/s10100-018-0524-0...... hiện toàn bộ
Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
Springer Science and Business Media LLC - Tập 9 - Trang 513-521 - 2014
This paper was originally motivated by the problem of providing a point-based formula (only involving the nominal data, and not data in a neighborhood) for estimating the calmness modulus of the optimal set mapping in linear semi-infinite optimization under perturbations of all coefficients. With this aim in mind, the paper establishes as a key tool a basic result on finite-valued convex functions...... hiện toàn bộ
A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
Springer Science and Business Media LLC - Tập 8 - Trang 2349-2356 - 2014
In the capacitated team orienteering problem, a fleet of vehicles visits and services a subset of customers in order to maximize the total profit collected while obeying capacity and route length constraints. In the split delivery team orienteering problem (SDCTOP), multiple vehicles can service the same customer; each vehicle satisfies some, but not all, of the customer demand. Allowing split del...... hiện toàn bộ
The Picard–HSS iteration method for absolute value equations
Springer Science and Business Media LLC - Tập 8 - Trang 2191-2202 - 2014
Recently Bai and Yang in (Appl Numer Math 59:2923–2936, 2009) proposed the Picard–Hermitian and skew-Hermitian splitting (HSS) iteration method to solve the system of nonlinear equations
$$Ax=\varphi (x)$$
, where
...... hiện toàn bộ
Tổng số: 1,363
- 1
- 2
- 3
- 4
- 5
- 6
- 10