Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007

Tsitouras, Charalampos

doi:10.1016/j.amc.2011.04.002

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, a multiagent algorithm is proposed to solve dynamic problems in Lepagnot et al 1 The algorithm therein is based on multiple trajectory searches, and saving the optima found to use them when a change is detected in the environment. In Tsitouras, 2 a method of biproportional allocation was presented and applied as a binary transportation problem to the parliamentary election system. In general, DCOPs can be solved efficiently by using several modern approaches (see other studies 3‐12 ).…”

Section: Introductionmentioning

confidence: 99%

Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance

Medvedeva

Katsikis

Mourtas

et al. 2020

Math Methods in App Sciences

View full text Add to dashboard Cite

The knapsack problem is a problem in combinatorial optimization, and in many such problems, exhaustive search is not tractable. In this paper, we describe and analyze the randomized time-varying knapsack problem (RTVKP) as a time-varying integer linear programming (TV-ILP) problem. In this way, we present the on-line solution to the RTVKP combinatorial optimization problem and highlight the restrictions of static methods. In addition, the RTVKP is applied in the field of finance and converted into a portfolio insurance problem. Our methodology is confirmed by simulation tests in real-world data sets, in order to explain being an excellent alternative to traditional approaches.

show abstract

Section: Introductionmentioning

confidence: 99%