Titlebook: Combinatorial Optimization; 5th International Sy Jon Lee,Giovanni Rinaldi,A. Ridha Mahjoub Conference proceedings 2018 Springer Internation

疲劳

Online Firefighting on Trees,it. In this paper, we focus on the case of trees and we consider as well the . game where the amount of protection allocated to a vertex lies between 0 and 1. We introduce the online version of both . and ., in which the number of firefighters available at each turn is revealed over time. We show th

Intend

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem,actly . edges, connecting the . clusters . through the selection of a unique vertex in each cluster. GMSTP finds applications in network design, irrigation agriculture, smart cities, data science, among others. This paper presents a new multigraph mathematical formulation for GMSTP which is compared

边缘带来墨水

chastise

A PTAS for the Time-Invariant Incremental Knapsack Problem, increases and items can be added, but not removed from the knapsack. The goal is to maximize the sum of profits over all times. . models various applications including specific financial markets and governmental decision processes. . is strongly NP-Hard [.] and there has been work [., ., ., ., .] o

走调

透明

Efficient Algorithms for Measuring the Funnel-Likeness of DAGs,nnels are an analog to trees for directed graphs that is more restrictive than DAGs but more expressive than in-/out-trees. Computational problems such as finding vertex-disjoint paths or tracking the origin of memes remain NP-hard on DAGs while on funnels they become solvable in polynomial time. Ou

斜坡

变异

入伍仪式

Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem,hat are partly or fully located within circle of a radius of 200 m. In this work, we present the multi-start local search meta-heuristics that has been developed to solve the real case of an insurance company having more than 400 thousand insured buildings in mainland Portugal. A random sample of th

CAGE