Titlebook: Combinatorial Optimization and Applications; First International Andreas Dress,Yinfeng Xu,Binhai Zhu Conference proceedings 2007 Springer-

FLAW

书目名称Combinatorial Optimization and Applications影响因子(影响力)




书目名称Combinatorial Optimization and Applications影响因子(影响力)学科排名




书目名称Combinatorial Optimization and Applications网络公开度




书目名称Combinatorial Optimization and Applications网络公开度学科排名




书目名称Combinatorial Optimization and Applications被引频次




书目名称Combinatorial Optimization and Applications被引频次学科排名




书目名称Combinatorial Optimization and Applications年度引用




书目名称Combinatorial Optimization and Applications年度引用学科排名




书目名称Combinatorial Optimization and Applications读者反馈




书目名称Combinatorial Optimization and Applications读者反馈学科排名

运动的我

Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes..(.,.) = (., ⋯ ,.,., ⋯ ,.) is defined as a shortest path ..(.,.) from . to . which does not make use of (.,.). In this paper, we focus on the problem of finding an edge . = (.,.) ∈ ..(.,.) whose removal produces a replacement path at node . such that the ratio of the length of ..(.,.) to the length

没收

HACK

Heterodoxy

An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespanto minimize makespan. For the proportional special version, i.e., there exists a fixed number . such that .. = .. for every 1 ≤ . ≤ ., we first present a lower bound of 3/2 for the approximation ratio and then design an APTAS for it. Our basic idea is quite simple: we first enumerate all the partial

MAPLE

A New Dynamic Programming Algorithm for Multiple Sequence Alignmentessive alignment algorithm for this very difficult problem. Given two groups A and B of aligned sequences, this algorithm uses Dynamic Programming and the sum-of-pairs objective function to determine an optimal alignment C of A and B. The proposed algorithm has a much lower time complexity compared

MAPLE

Energy Minimizing Vehicle Routing Problemblem with this new load-based cost objective is called the Energy Minimizing Vehicle Routing Problem (EMVRP). Integer linear programming formulations with .(..) binary variables and .(..) constraints are developed for the collection and delivery cases, separately. The proposed models are tested and

珊瑚

煤渣

The Minimum Risk Spanning Tree Problem, each link . ∈ . can be established by paying a cost ., and accordingly takes a risk . of link failure. The . (MRST) problem is to establish a spanning tree in . of total cost no more than a given constant so that the risk sum over the links on the spanning tree is minimized. In this paper, we prop

圆柱