Artículos -

Navegar

Últimos Documentos Autor FCEN - Año Autor FCEN - Revista Año - Revista Revista - Año SubjectPcEn Colores Type

Colección

Lista de

$
0
1
-
1
1
-
1
-
1
-
1
1
1
2
3
4
5
6
7
8
9
a
a
-
a
-
a
-
a
-
a
-
a
-
a
-
a
-
a
-
a
-
a
-
‐
a
-
‐
-
a
-
a
-
a
-
a
-
a
-
a
-
‐
a
-
a
-
a
-
a
b
-
b
-
b
-
b
c
-
c
-
c
-
c
-
c
-
c
-
c
-
c
-
c
+
c
-
c
-
c
-
c
-
c
-
c
-
c
-
c
c
-
c
-
c
d
-
d
-
d
-
d
-
d
-
d
-
d
e
-
e
-
e
-
e
-
e
-
e
-
e
-
e
-
e
f
-
f
-
f
f
g
-
g
-
g
-
g
-
g
-
g
-
g
-
g
-
‐
g
-
g
-
‐
g
-
g
h
‐
h
h
-
h
-
h
-
h
-
h
i
-
i
j
k
-
k
-
k
-
k
-
k
-
k
l
-
l
-
l
-
l
-
l
-
l
-
l
l
+
l
±
l
l
m
-
m
-
m
-
m
-
m
-
m
+
m
-
m
-
m
-
m
-
‐
m
n
-
n
-
n
-
n
-
n
o
p
-
p
p
-
p
-
p
q
r
-
r
-
r
s
-
s
-
s
{
s
-
s
t
-
t
‐
-
t
-
t
-
t
t
-
t
u
v
v
w
x
-
x
y
z
α
β
—
,
δ
π
-

Combinatorial optimization

"Computing the P 3 -hull number of a graph, a polyhedral approach" (2019) Blaum, M.; Marenco, J. Discrete Applied Mathematics. 255:155-166

"Characterising Chordal ContactB0-VPG Graphs" (2018) Bonomo, F.;Mazzoleni, M.P.;Rean, M.L. (...)Lee J. 5th International Symposium on Combinatorial Optimization, ISCO 2018. 10856 LNCS:89-100

"Energy-aware scheduling mandatory/optional tasks in multicore real-time systems" (2017) Méndez-Díaz, I.; Orozco, J.; Santos, R.; Zabala, P. International Transactions in Operational Research. 24(1-2):173-198

"A branch-and-cut algorithm for the latent-class logit assortment problem" (2014) Méndez-Díaz, I.; Miranda-Bront, J.J.; Vulcano, G.; Zabala, P. Discrete Applied Mathematics. 164(PART 1):246-263

"A tabu search heuristic for the equitable coloring problem" (2014) Méndez Díaz, I.; Nasini, G.; Severín, D.; Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:347-358

"b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs" (2014) Bonomo, F.;Schaudt, O.;Stein, M. (...)Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:100-111

"Facets and valid inequalities for the time-dependent travelling salesman problem" (2014) Miranda-Bront, J.J.; Méndez-Díaz, I.; Zabala, P. European Journal of Operational Research. 236(3):891-902

"Facets and valid inequalities for the time-dependent travelling salesman problem" (2013) Miranda-Bront, J.J.; Méndez-Díaz, I.; Zabala, P. European Journal of Operational Research

"Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property" (2013) Bonomo, F.; Oriolo, G.; Snels, C.; Stauffer, G. 16th Conference on Integer Programming and Combinatorial Optimization, IPCO 2013. 7801 LNCS:86-97

"A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem" (2011) Delle Donne, D.; Marenco, J. Discrete Optimization. 8(4):540-554

"Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):64-78

"Cycle-based facets of chromatic scheduling polytopes" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):51-63

"Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem" (2008) Tabacman, M.; Bacardit, J.; Krasnogor, N.; Loiseau, I. 10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008:2039-2046

"A new metaheuristic and its application to the Steiner problems in graphs" (2001) Urrutia, S.; Loiseau, I. Proceedings - International Conference of the Chilean Computer Science Society, SCCC. 2001-January:273-281