Titlebook: Learning and Intelligent Optimization; 13th International C Nikolaos F. Matsatsinis,Yannis Marinakis,Panos Par Conference proceedings 2020

荒唐

Magnificent

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop,b aggregation at some node of a transportation network can be seen as an instance of a bin packing problem. We show that for a two-machine case a positive answer to the Irreducible Bin Packing problem question at some node leads to a linear algorithm of constructing an optimal schedule subject to some restrictions on the location of that node.

酷熱

Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence,ounded from above and below by given some constants. It is shown that the considered problem is the strongly NP-hard one. An exact algorithm is proposed for the case of integer-valued input of the problem. This algorithm has a pseudopolynomial running time if the space dimension is fixed.

階層

PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows, remain PTAS for slow-growing dependencies . and .. In this paper, combining the well-known instance decomposition framework by A.?Adamaszek et al. and QPTAS by L.?Song et al. we propose a novel approximation scheme for the planar CVRPTW, whose running time remains polynomial for the significantly wider range of . and ..

性冷淡

Indicative

Adaptive GVNS Heuristics for Solving the Pollution Location Inventory Routing Problem,d Search versions, illustrates the effectiveness of the intelligent mechanism used for automating the re-ordering of the local search operators in the improvement step of each optimization method. Results on 20 PLIRP benchmark instances show the efficiency of the proposed metaheuristics.

制造

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inpm collected profit and minimum traveling costs constraints. We show polynomial-time approximation algorithms for two variants of the problem and establish conditions under which the presented algorithms are asymptotically optimal on random inputs.

LIKEN

0302-9743 optimization, machine learning, and artificial intelligence and?describe advanced ideas, technologies, methods, and applications in optimization and machine learning..978-3-030-38628-3978-3-030-38629-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

nocturnal

評(píng)論性