Titlebook: Discrete Optimization and Operations Research; 9th International Co Yury Kochetov,Michael Khachay,Panos Pardalos Conference proceedings 201

脆弱帶來

碳水化合物

Graduated

On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random InputsP with different weight functions on random inputs. The probabilistic analysis carried out for that algorithm is not suitable in the case of the m-PSP with identical weight functions..In this paper we present an approach which under certain conditions gives polynomial asymptotically optimal algorith

勾引

Efficient Randomized Algorithm for a Vector Subset Problem Euclidean space . such that the norm of the corresponding sum-vector is maximum. We derive the relation between algorithm’s time complexity, relative error and failure probability parameters. We show that the algorithm implements Polynomial-time Randomized Approximation Scheme (PRAS) for the genera

表狀態(tài)

創(chuàng)造性

An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions um of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the centers of the other clusters are unknown and determined as the mean values over clusters elements. Additionally, there are a

惡意

A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem the weighted sum of the squared intracluster distances from the elements of the clusters to their centers. The weights of sums are the cardinalities of the clusters. The center of one of the clusters is given as input, while the center of the other cluster is unknown and determined as the geometric

Entropion

PTAS for the Euclidean Capacitated Vehicle Routing Problem in ,d dimension. Thirty years ago, in their celebrated paper, M. Haimovich and A. Rinnoy Kan proposed the first PTAS for the Planar Single Depot CVRP based on their Iterated Tour Partition heuristic. For decades, this result was extended by many authors to numerous useful modifications of the problem ta

pester

On Integer Recognition over Some Boolean Quadric Polytope Extension consider integer recognition over polytope . and its LP relaxation .. These polytopes are natural extensions of the well-known Boolean quadric polytope . and its rooted semimetric relaxation ...Integer recognition over . is NP-complete, since various special instances of 3-SAT problem like NAE-3SAT

lethal

https://doi.org/10.1007/978-3-319-44914-2algorithms; approximation algorithms; clustering; computational results; discrete optimzation; game theor