Results 31 to 40 of about 161,336 (310)

Approximating Bin Packing within O(log OPT * log log OPT) bins [PDF]

, 2013
For bin packing, the input consists of n items with sizes s_1,...,s_n in [0,1] which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log^2 OPT) bins.
Rothvoss, Thomas
core   +1 more source

A novel hybrid approach for solving the multiple traveling salesmen problem

Arab Journal of Basic and Applied Sciences, 2019
The multiple Travelling Salesmen Problem (mTSP) is one of the most popular and important operational research problems. It is a problem where n salesmen have to visit m cities such that each salesman has to visit at least one city and all the cities ...
Youssef Harrath, Abdul Fattah Salman, Abdulla Alqaddoumi, Hesham Hasan, Ahmed Radhi   +4 more
doaj   +1 more source

A Wavelength-Division-Multiplexed Passive Optical Network With Simultaneous Centralized Light Source and Broadcast Capability

IEEE Photonics Journal, 2010
We propose and experimentally demonstrate a wavelength-division-multiplexed (WDM) passive optical network (PON) architecture with simultaneous centralized light source and broadcast capability. The proposed WDM-PON supports simultaneous delivery of 10-Gb/
Fangzheng Zhang, Songnian Fu, Jian Wu, Kun Xu, Jintong Lin, Ping Shum   +5 more
doaj   +1 more source

Superconductivity Studied by Solving Ab Initio Low-Energy Effective Hamiltonians for Carrier Doped CaCuO_{2}, Bi_{2}Sr_{2}CuO_{6}, Bi_{2}Sr_{2}CaCu_{2}O_{8}, and HgBa_{2}CuO_{4}

Physical Review X, 2023
Understanding the materials dependence together with the universal controlling parameter of superconductivity (SC) in copper oxide superconductors is one of the major challenges in condensed matter physics.
Michael Thobias Schmid, Jean-Baptiste Morée, Ryui Kaneko, Youhei Yamaji, Masatoshi Imada   +4 more
doaj   +1 more source

Ordering of high-density markers by the k-Optimal algorithm for the traveling-salesman problem

Crop Journal, 2020
Construction of accurate and high-density linkage maps is a key research area of genetics. We investigated the efficiency of genetic map construction (MAP) using modifications of the k-Optimal (k-Opt) algorithm for solving the traveling-salesman problem (
Luyan Zhang, Huihui Li, Lei Meng, Jiankang Wang   +3 more
doaj   +1 more source

Germanium on Glass: A Novel Platform for Light-Sensing Devices

IEEE Photonics Journal, 2010
Using layer transfer and wafer bonding followed by epitaxial regrowth, we design, realize, and characterize a novel generation of Germanium-on-Glass (GoG) near-infrared light sensors.
L. Colace, V. Sorianello, G. Assanto, D. Fulgoni, L. Nash, M. Palmer   +5 more
doaj   +1 more source

A novel solution approach for travelling salesman problem: TPORT [PDF]

, 2019
Bu çalışmada,yöneylem araştırması alanının en çok çalışılan problemlerden biri olan gezgin satıcı ve ulaştırma problemleri üzerinde durulmakta ve aralarındaki ilişkiden faydalanan yeni bir çözüm algoritması önerilmektedir. Ulaştırma problemleri için
Karagül, Kenan
core   +2 more sources

Evaluating the neighborhood, hybrid and reversion search techniques of a simulated annealing algorithm in solving forest spatial harvest scheduling problems

Silva Fennica, 2016
Heuristic techniques have been increasingly used to address the complex forest planning problems over the last few decades. However, heuristics only can provide acceptable solutions to difficult problems, rather than guarantee that the optimal solution ...
Dong, Lingbo, Bettinger, Pete, Liu, Zhaogang, Qin, Huiyan, Zhao, Yinghui   +4 more
doaj   +1 more source

Modelling spatial and temporal dynamics of gross primary production in the Sahel from earth-observation-based photosynthetic capacity and quantum efficiency [PDF]

Biogeosciences, 2017
It has been shown that vegetation growth in semi-arid regions is important to the global terrestrial CO2 sink, which indicates the strong need for improved understanding and spatially explicit estimates of CO2 uptake (gross primary production; GPP) in ...
T. Tagesson, J. Ardö, B. Cappelaere, L. Kergoat, A. Abdi, S. Horion, R. Fensholt   +6 more
doaj   +1 more source

Parallel 2-Opt Local Search On Gpu

, 2017
To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple implementation based on Graphics Processing Unit (GPU) is presented and tested in this paper. The parallel scheme is based on technique of data decomposition by dynamically assigning multiple K processors on the integral ...
Qiao, Wen-Bao, Jean-Charles Créput
openaire   +1 more source