Results 51 to 55 of about 284 (55)
The study of new fixed-point iteration schemes for solving absolute value equations. [PDF]
HeliyonAli R, Zhang Z, Awwad FA.
europepmc +1 more source
Approximation algorithms for discrete polynomial optimization [PDF]
, 2013 He, Simai, Li, Zhening, Zhang, Shuzhong
core +1 more source
On optimal low rank Tucker approximation for tensors:the case for an adjustable core size [PDF]
, 2014 Chen, Bilian +2 more
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
, 2020A major operational task in city logistics is related to waste collection. Due to large problem sizes and numerous constraints, the optimization of real-life waste collection problems on a daily basis requires the use of metaheuristic solving frameworks ...
Aljoscha Gruler +3 more
semanticscholar +1 more source
Solution of maximum clique problem by using branch and bound method
, 2014The maximum clique problems have been widely applied in the field of operations research. The maximum clique problem is finding a solution that is often considered difficult, as well as graph coloring problem, traveling salesman, and so forth.
M. Suyudi +4 more
semanticscholar +1 more source