Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             79 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives Bahiense, Laura
 2014
 41-50 P1 p. 34-46
13 p.
 artikel
2 A branch-and-cut algorithm for the latent-class logit assortment problem Méndez-Díaz, Isabel
 2014
 41-50 P1 p. 246-263
18 p.
 artikel
3 A continuous strategy to solve a class of mixed optimization problems Nascimento, Roberto Quirino do
 2014
 41-50 P1 p. 264-275
12 p.
 artikel
4 A hybrid algorithm for the DNA sequencing problem Caserta, Marco
 2014
 41-50 P1 p. 87-99
13 p.
 artikel
5 Algorithmic aspects of open neighborhood location–domination in graphs Panda, B.S.
 2017
 41-50 P1 p. 290-306
17 p.
 artikel
6 Algorithms for nesting with defects Baldacci, Roberto
 2014
 41-50 P1 p. 17-33
17 p.
 artikel
7 A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs Witkowski, Rafał
 2014
 41-50 P1 p. 349-355
7 p.
 artikel
8 Alternative MIP formulations for an integrated shift scheduling and task assignment problem Telhada, João
 2014
 41-50 P1 p. 328-343
16 p.
 artikel
9 A new LBFS-based algorithm for cocomparability graph recognition Dusart, Jérémie
 2017
 41-50 P1 p. 149-161
13 p.
 artikel
10 An ILP-refined tabu search for the Directed Profitable Rural Postman Problem Archetti, C.
 2014
 41-50 P1 p. 3-16
14 p.
 artikel
11 A note on the Clustered Set Covering Problem Alfandari, Laurent
 2014
 41-50 P1 p. 13-19
7 p.
 artikel
12 Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times Kacem, Imed
 2014
 41-50 P1 p. 154-160
7 p.
 artikel
13 A set-covering based heuristic algorithm for the periodic vehicle routing problem Cacchiani, V.
 2014
 41-50 P1 p. 53-64
12 p.
 artikel
14 A sufficient condition to extend polynomial results for the Maximum Independent Set Problem Mosca, Raffaele
 2017
 41-50 P1 p. 281-289
9 p.
 artikel
15 Characterization and recognition of some opposition and coalition graph classes Le, Van Bang
 2017
 41-50 P1 p. 261-272
12 p.
 artikel
16 Characterizing width two for variants of treewidth Bodlaender, Hans L.
 2017
 41-50 P1 p. 29-46
18 p.
 artikel
17 Combinatorial optimization: theory, computation, and applications Chen, Bo
 2017
 41-50 P1 p. 1-2
2 p.
 artikel
18 Complexity of coloring graphs without paths and cycles Hell, Pavol
 2017
 41-50 P1 p. 211-232
22 p.
 artikel
19 Complexity of colouring problems restricted to unichord-free and { square,unichord }-free graphs Machado, Raphael C.S.
 2014
 41-50 P1 p. 191-199
9 p.
 artikel
20 Contents 2017
 41-50 P1 p. v-vi
nvt p.
 artikel
21 Contents 2017
 41-50 P1 p. v-
1 p.
 artikel
22 Contents 2014
 41-50 P1 p. v-
1 p.
 artikel
23 Contents 2014
 41-50 P1 p. v-vi
nvt p.
 artikel
24 Covering points with orthogonal polygons Evrendilek, Cem
 2014
 41-50 P1 p. 92-99
8 p.
 artikel
25 Differential approximation schemes for half-product related functions and their scheduling applications Sarto Basso, Rebecca
 2017
 41-50 P1 p. 71-78
8 p.
 artikel
26 Earliest arrival flows in networks with multiple sinks Schmidt, Melanie
 2014
 41-50 P1 p. 320-327
8 p.
 artikel
27 Edge-coloring of 3-uniform hypergraphs Obszarski, Paweł
 2017
 41-50 P1 p. 48-52
5 p.
 artikel
28 Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem Gamst, Mette
 2014
 41-50 P1 p. 121-137
17 p.
 artikel
29 Exponentiality of the exchange algorithm for finding another room-partitioning Edmonds, Jack
 2014
 41-50 P1 p. 86-91
6 p.
 artikel
30 Ferrers dimension of grid intersection graphs Chaplick, Steven
 2017
 41-50 P1 p. 130-135
6 p.
 artikel
31 Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection Cao, Yixin
 2017
 41-50 P1 p. 67-83
17 p.
 artikel
32 Fractional routing using pairs of failure-disjoint paths Ben-Ameur, W.
 2014
 41-50 P1 p. 47-60
14 p.
 artikel
33 Generating and counting unlabeled k -path graphs Pereira, Paulo Renato da Costa
 2014
 41-50 P1 p. 297-303
7 p.
 artikel
34 Graph editing to a fixed target Golovach, Petr A.
 2017
 41-50 P1 p. 181-190
10 p.
 artikel
35 Graph isomorphism for graph classes characterized by two forbidden induced subgraphs Kratsch, Stefan
 2017
 41-50 P1 p. 240-253
14 p.
 artikel
36 Graphs with maximal induced matchings of the same size Baptiste, Philippe
 2017
 41-50 P1 p. 15-28
14 p.
 artikel
37 Improving heuristics for network modularity maximization using an exact algorithm Cafieri, Sonia
 2014
 41-50 P1 p. 65-72
8 p.
 artikel
38 Influence of the normalization constraint on the integral simplex using decomposition Rosat, Samuel
 2017
 41-50 P1 p. 53-70
18 p.
 artikel
39 Lower and upper bounds for the Bin Packing Problem with Fragile Objects Clautiaux, François
 2014
 41-50 P1 p. 73-86
14 p.
 artikel
40 Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming Pınar, Mustafa Ç.
 2014
 41-50 P1 p. 304-312
9 p.
 artikel
41 Matching with sizes (or scheduling with processing set restrictions) Biró, Péter
 2014
 41-50 P1 p. 61-67
7 p.
 artikel
42 Maximum size of a minimum watching system and the graphs achieving the bound Auger, David
 2014
 41-50 P1 p. 20-33
14 p.
 artikel
43 Maximum weight independent sets in classes related to claw-free graphs Karthick, T.
 2017
 41-50 P1 p. 233-239
7 p.
 artikel
44 Max point-tolerance graphs Catanzaro, Daniele
 2017
 41-50 P1 p. 84-97
14 p.
 artikel
45 Minimal dominating sets in interval graphs and trees Golovach, Petr A.
 2017
 41-50 P1 p. 162-170
9 p.
 artikel
46 Morphological filtering on hypergraphs Sebastian Vadakkenveettil, Bino
 2017
 41-50 P1 p. 307-320
14 p.
 artikel
47 Natural and extended formulations for the Time-Dependent Traveling Salesman Problem Godinho, Maria Teresa
 2014
 41-50 P1 p. 138-153
16 p.
 artikel
48 New results on word-representable graphs Collins, Andrew
 2017
 41-50 P1 p. 136-141
6 p.
 artikel
49 New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem Hungerländer, Philipp
 2017
 41-50 P1 p. 19-39
21 p.
 artikel
50 [No title] Doerner, Karl F.
 2014
 41-50 P1 p. 1-2
2 p.
 artikel
51 On cardinality constrained polymatroids Maurras, Jean François
 2014
 41-50 P1 p. 237-245
9 p.
 artikel
52 On color-critical ( P 5 ,co- P 5 )-free graphs Dhaliwal, Harjinder S.
 2017
 41-50 P1 p. 142-148
7 p.
 artikel
53 On equistable, split, CIS, and related classes of graphs Boros, Endre
 2017
 41-50 P1 p. 47-66
20 p.
 artikel
54 On Minimum Reload Cost Cycle Cover Galbiati, Giulia
 2014
 41-50 P1 p. 112-120
9 p.
 artikel
55 On neighborhood-Helly graphs Groshaus, Marina
 2017
 41-50 P1 p. 191-202
12 p.
 artikel
56 On recognition of threshold tolerance graphs and their complements Golovach, Petr A.
 2017
 41-50 P1 p. 171-180
10 p.
 artikel
57 On the chromatic number of Toeplitz graphs Nicoloso, Sara
 2014
 41-50 P1 p. 286-296
11 p.
 artikel
58 On the linear description of the Huffman trees polytope Maurras, Jean-Francois
 2014
 41-50 P1 p. 225-236
12 p.
 artikel
59 On the Shortest Path Game Darmann, Andreas
 2017
 41-50 P1 p. 3-18
16 p.
 artikel
60 Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints Lodi, Andrea
 2017
 41-50 P1 p. 40-47
8 p.
 artikel
61 Preface de Werra, Dominique
 2014
 41-50 P1 p. 1-
1 p.
 artikel
62 Preface: Special graph classes and algorithms–in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday Dragan, Feodor F.
 2017
 41-50 P1 p. 1-
1 p.
 artikel
63 Quasi-optimal degree distribution for a quadratic programming problem arising from the p -version finite element method for a one-dimensional obstacle problem Maischak, Matthias
 2014
 41-50 P1 p. 200-209
10 p.
 artikel
64 Rainbow colouring of split graphs Chandran, L. Sunil
 2017
 41-50 P1 p. 98-113
16 p.
 artikel
65 Reconstructing trees from digitally convex sets Lafrance, Philip
 2017
 41-50 P1 p. 254-260
7 p.
 artikel
66 Robust location transportation problems under uncertain demands Gabrel, V.
 2014
 41-50 P1 p. 100-111
12 p.
 artikel
67 Scheduling arc maintenance jobs in a network to maximize total flow over time Boland, Natashia
 2014
 41-50 P1 p. 34-52
19 p.
 artikel
68 Scheduling problem with multi-purpose parallel machines Rodrigues, Rosiane de Freitas
 2014
 41-50 P1 p. 313-319
7 p.
 artikel
69 Solving the maximum edge biclique packing problem on unbalanced bipartite graphs Acuña, V.
 2014
 41-50 P1 p. 2-12
11 p.
 artikel
70 The discrete ellipsoid covering problem: A discrete geometric programming approach do Nascimento, Roberto Quirino
 2014
 41-50 P1 p. 276-285
10 p.
 artikel
71 The location-dispatching problem: Polyhedral results and content delivery network design Chrétienne, Philippe
 2014
 41-50 P1 p. 68-85
18 p.
 artikel
72 The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm Martinez, Leonardo Conegundes
 2014
 41-50 P1 p. 210-224
15 p.
 artikel
73 The Steiner Tree Problem with Delays: A compact formulation and reduction procedures Leggieri, Valeria
 2014
 41-50 P1 p. 178-190
13 p.
 artikel
74 Thin strip graphs Hayashi, Takashi
 2017
 41-50 P1 p. 203-210
8 p.
 artikel
75 Threshold-coloring and unit-cube contact representation of planar graphs Alam, Md. Jawaherul
 2017
 41-50 P1 p. 2-14
13 p.
 artikel
76 Treewidth and Pathwidth parameterized by the vertex cover number Chapelle, Mathieu
 2017
 41-50 P1 p. 114-129
16 p.
 artikel
77 Unicyclic graphs of given girth k ≥ 4 having smallest general sum-connectivity index Tomescu, Ioan
 2014
 41-50 P1 p. 344-348
5 p.
 artikel
78 Using local similarity measures to efficiently address approximate graph matching Kpodjedo, Segla
 2014
 41-50 P1 p. 161-177
17 p.
 artikel
79 Vertex coloring of graphs with few obstructions Lozin, V.V.
 2017
 41-50 P1 p. 273-280
8 p.
 artikel
                             79 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland