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:
On linear algebraic algorithms for the subgraph matching problem and its variants
Springer Science and Business Media LLC - - 2023
For a given simple data graph G and a simple query graph H, the subgraph
matching problem is to find all the subgraphs of G, each isomorphic to H. There
are many combinatorial algorithms for it and its counting version, which are
predominantly based on backtracking with several pruning techniques. Much less
is known about linear algebraic (LA, for short), i.e., adjacency matrix algebra,
algorithms...
A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect
Springer Science and Business Media LLC - Tập 17 - Trang 879-900 - 2022
In this paper, a Positron Emission Tomography/Computed Tomography (PET/CT)
examination scheduling problem considering multi-stage processes is studied.
Before the actual examination process, imaging agents (a drug with
radioactivity) need to be injected into patients. The radioactivity of the
imaging agents continuously decays, which results in the required dose by
patients increasing with time, i...
Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
Springer Science and Business Media LLC - - 2014
A smoothing Newton method for symmetric cone complementarity problems
Springer Science and Business Media LLC - Tập 9 - Trang 225-244 - 2013
Recently, there has been much interest in studying optimization problems over
symmetric cones. This paper uses Euclidean Jordan algebras as a basic tool to
construct a new smoothing function for symmetric cone complementarity problems.
It is showed that this new function has similar structure and some good
properties as the widely used symmetric perturbed Chen–Harker–Kanzow–Smale
smooth function. ...
A simple SSD-efficiency test
Springer Science and Business Media LLC - Tập 8 - Trang 2135-2143 - 2014
A linear programming SSD-efficiency test capable of identifying a dominating
portfolio is proposed. It has $$T+n$$ variables and at most $$2T+1$$
constraints, whereas the existing SSD-efficiency tests are either unable to
identify a dominating portfolio, or require solving a linear program with at
least $$O(T^2+n)$$ variables and/or constraints....
Correction to: Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application
Springer Science and Business Media LLC - Tập 14 - Trang 1287-1287 - 2019
In the original publication of the article, the name of the corresponding author
was incorrectly published as “Amir Ahamdi”.
Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$ algorithm for $$d$$ -degenerate graphs
Springer Science and Business Media LLC - Tập 8 - Trang 1611-1617 - 2013
We describe an algorithm for the maximum clique problem that is parameterized by
the graph’s degeneracy $$d$$ . The algorithm runs in $$O\left( nm+n T_d \right)
$$ time, where $$T_d$$ is the time to solve the maximum clique problem in an
arbitrary graph on $$d$$ vertices. The best bound as of now is
$$T_d=O(2^{d/4})$$ by Robson. This shows that the maximum clique problem is
solvable in $$O(nm)$$ t...
On the solution existence to convex polynomial programs and its applications
Springer Science and Business Media LLC - Tập 15 - Trang 719-731 - 2021
In this paper, we present necessary/sufficient conditions for the convex
polynomial programming (CPP) problems. Some new stability results for parametric
CPP problems are characterized under a regular condition. We give a positive
answer for the open question in Kim et al. (Optim Lett 6:363–373, 2012) for the
solution existence of convex quadratic programming problems.
Linearized formulations for failure aware barter exchange
Springer Science and Business Media LLC - Tập 16 - Trang 1301-1313 - 2021
Mathematical programming formulations are developed for determining chains of
organ-donation exchange pairs in a compatibility graph where pairwise exchanges
may fail. The objective is to maximize the expected value where pairs are known
to fail with given probabilities. In previous work, namely that of Dickerson et
al. (Manag Sci 65(4):323–340, 2019) this NP-hard problem was solved
heuristically ...
Tổng số: 1,363
- 1
- 2
- 3
- 4
- 5
- 6
- 10