|
31 |
A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets
Esparza, Javier. - Hildesheim : Inst. für Informatik, 1991
|
|
|
32 |
An interior point algorithm to solve computationally difficult set covering problems
Enthalten in Mathematical programming Bd. 52, Nr. 1-3, date:5.1991: 597-618
|
|
|
|
33 |
An optimal algorithm for finding a minimum clique covering of a circular arc graph
Asano, Takao. - Bonn : Sonderforschungsbereich 303, 1989
|
|
|
|
34 |
A decomposition algorithm for linear relaxation of the weightedr-covering problem
Enthalten in Mathematical programming Bd. 31, Nr. 1, date:1.1985: 67-77
|
|
|
|
35 |
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
Enthalten in Mathematical programming Bd. 22, Nr. 1, date:12.1982: 350-357
|
|
|
|
36 |
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
Enthalten in Mathematical programming Bd. 22, Nr. 1, date:12.1982: 231-235
|
|
|
|
37 |
An analysis of the greedy algorithm for the submodular set covering problem
Enthalten in Combinatorica Bd. 2, Nr. 4, date:12.1982: 385-393
|
|
|
|
38 |
A Genetic Algorithm for the Set Covering Problem
Enthalten in Operational Research Society: Journal of the Operational Research Society Bd. 47, 1.1.1996, Nr. 5, date:5.1996: 702-709
|
|
|
|
39 |
A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem
Enthalten in International journal of machine learning and cybernetics Bd. 8, 7.12.2015, Nr. 2, date:4.2017: 691-697
|
|
|
|
40 |
A primal algorithm for the weighted minimum covering ball problem in $$\mathbb R}^n$$ R n
Enthalten in Top Bd. 24, 7.12.2015, Nr. 2, date:7.2016: 466-492
|
|
Administration
