nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Aggregate production planning problem. A new algorithm
|
Pradenas, Lorena |
|
2004 |
18 |
C |
p. 193-199 7 p. |
artikel |
2 |
A GRASP algorithm with RNN based local search for designing a WAN access network
|
Cancela, Héctor |
|
2004 |
18 |
C |
p. 59-65 7 p. |
artikel |
3 |
A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
|
Lima, C.M.R.R. |
|
2004 |
18 |
C |
p. 171-176 6 p. |
artikel |
4 |
An Ant Colony Algorithm for the Capacitated Vehicle Routing
|
Mazzeo, Silvia |
|
2004 |
18 |
C |
p. 181-186 6 p. |
artikel |
5 |
Approximation Results on Balanced Connected Partitions of Graphs
|
Salgado, Liliane R.B. |
|
2004 |
18 |
C |
p. 207-212 6 p. |
artikel |
6 |
A representation for the modular-pairs of a cograph by modular decomposition
|
Klein, Sulamita |
|
2004 |
18 |
C |
p. 165-169 5 p. |
artikel |
7 |
A result on the total colouring of powers of cycles
|
Campos, C.N. |
|
2004 |
18 |
C |
p. 47-52 6 p. |
artikel |
8 |
Characterizations of Postman Sets
|
Aguilera, Néstor E. |
|
2004 |
18 |
C |
p. 5-10 6 p. |
artikel |
9 |
Clique-Critical Graphs
|
Alcón, Liliana |
|
2004 |
18 |
C |
p. 11-15 5 p. |
artikel |
10 |
Clique-independent sets of Helly circular-arc graphs
|
Durán, Guillermo |
|
2004 |
18 |
C |
p. 103-108 6 p. |
artikel |
11 |
Color-blind Graphs and Suboptimal Colorings
|
Blöchliger, Ivo |
|
2004 |
18 |
C |
p. 37-40 4 p. |
artikel |
12 |
Combinatorial equivalence of Chromatic Scheduling Polytopes
|
Marenco, Javier |
|
2004 |
18 |
C |
p. 177-180 4 p. |
artikel |
13 |
Computational complexity of edge modification problems in different classes of graphs
|
Burzyn, Pablo |
|
2004 |
18 |
C |
p. 41-46 6 p. |
artikel |
14 |
Difficult Problems in Threshold Graphs
|
Ortiz Z., Carmen |
|
2004 |
18 |
C |
p. 187-192 6 p. |
artikel |
15 |
Domination Invariant of a Diameter Constrained Network Reliability Model
|
Cancela, Héctor |
|
2004 |
18 |
C |
p. 53-58 6 p. |
artikel |
16 |
Eliminating redundant solutions of some symmetric combinatorial integer programs
|
Rey, Pablo A. |
|
2004 |
18 |
C |
p. 201-206 6 p. |
artikel |
17 |
Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs
|
Hernandez, Gonzalo |
|
2004 |
18 |
C |
p. 151-156 6 p. |
artikel |
18 |
Latin-American Conference on Combinatorics, Graphs and Applications
|
Liebling, Th.M. |
|
2004 |
18 |
C |
p. 1-4 4 p. |
artikel |
19 |
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules
|
Urrutia, Sebastián |
|
2004 |
18 |
C |
p. 227-233 7 p. |
artikel |
20 |
Multiple hamiltonian covers
|
Fetter, Hans L. |
|
2004 |
18 |
C |
p. 133-137 5 p. |
artikel |
21 |
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations
|
Correa, José R. |
|
2004 |
18 |
C |
p. 89-95 7 p. |
artikel |
22 |
New advances about a conjecture on Helly circle graphs
|
Barrionuevo, Juan Manuel |
|
2004 |
18 |
C |
p. 31-36 6 p. |
artikel |
23 |
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a 3 4 -approximation for finding maximum planar induced subgraphs
|
Faria, Luerbio |
|
2004 |
18 |
C |
p. 121-126 6 p. |
artikel |
24 |
Note on Lift-and-Project Ranks and Antiblocker Duality
|
Escalante, M.S. |
|
2004 |
18 |
C |
p. 115-119 5 p. |
artikel |
25 |
On a certain class of nonideal clutters
|
Argiroffo, G. |
|
2004 |
18 |
C |
p. 25-30 6 p. |
artikel |
26 |
On Clique-inverse graphs of K p -free graphs
|
Gravier, Sylvain |
|
2004 |
18 |
C |
p. 139-143 5 p. |
artikel |
27 |
On minimal N +– rank graphs
|
Escalante, M. |
|
2004 |
18 |
C |
p. 109-114 6 p. |
artikel |
28 |
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation
|
Cerioli, M.R. |
|
2004 |
18 |
C |
p. 73-79 7 p. |
artikel |
29 |
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks
|
Candia-Véjar, Alfredo |
|
2004 |
18 |
C |
p. 67-72 6 p. |
artikel |
30 |
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC
|
Hiller, Benjamin |
|
2004 |
18 |
C |
p. 157-163 7 p. |
artikel |
31 |
1-restricted Simple 2-matchings
|
Hartvigsen, David |
|
2004 |
18 |
C |
p. 145-149 5 p. |
artikel |
32 |
Rhombus tilings: decomposition and space structure
|
Chavanon, Frédéric |
|
2004 |
18 |
C |
p. 81-87 7 p. |
artikel |
33 |
Some Formulations for the Group Steiner Tree Problem
|
Ferreira, Carlos E. |
|
2004 |
18 |
C |
p. 127-132 6 p. |
artikel |
34 |
The sandwich problem for cutsets
|
Teixeira, Rafael B. |
|
2004 |
18 |
C |
p. 219-225 7 p. |
artikel |
35 |
The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs
|
Stauffer, Gautier |
|
2004 |
18 |
C |
p. 213-218 6 p. |
artikel |
36 |
Treelike Comparability Graphs
|
Dobson, Maria Patricia |
|
2004 |
18 |
C |
p. 97-102 6 p. |
artikel |
37 |
Tree Loop Graphs
|
Alcón, Liliana |
|
2004 |
18 |
C |
p. 17-23 7 p. |
artikel |