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
 
                             68 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking Santos, Fernando Afonso
 2011
 37 C p. 249-254
6 p.
 artikel
2 A dynamic programming algorithm for the tree mapping problem Ferreira, C.E.
 2011
 37 C p. 147-152
6 p.
 artikel
3 A graph-theoretical approach to cancelling critical elements Ayala, R.
 2011
 37 C p. 285-290
6 p.
 artikel
4 Algebraic connectivity on a subclass of caterpillars Rojo, Oscar
 2011
 37 C p. 153-158
6 p.
 artikel
5 A lower bound on the Chvátal-rank of Antiwebs Holm, Eugenia
 2011
 37 C p. 381-386
6 p.
 artikel
6 An effective compact formulation of the max cut problem on sparse graphs Lancia, Giuseppe
 2011
 37 C p. 111-116
6 p.
 artikel
7 A New Facet Generating Procedure for the Stable Set Polytope Xavier, Álinson S.
 2011
 37 C p. 183-188
6 p.
 artikel
8 A New Formulation for Spanning Trees Urrutia, Sebastián
 2011
 37 C p. 195-200
6 p.
 artikel
9 An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem Berinsky, Hernán
 2011
 37 C p. 273-278
6 p.
 artikel
10 A note on counting orientations Kohayakawa, Y.
 2011
 37 C p. 3-8
6 p.
 artikel
11 A note on random k-dimensional posets Corrêa, Ricardo
 2011
 37 C p. 51-56
6 p.
 artikel
12 A note on the primal-dual column generation method for combinatorial optimization Munari, Pedro
 2011
 37 C p. 309-314
6 p.
 artikel
13 A polyhedral study of the single-item lot-sizing problem with continuous start-up costs Escalante, Mariana S.
 2011
 37 C p. 261-266
6 p.
 artikel
14 Approximating Subdense Instances of Covering Problems Cardinal, Jean
 2011
 37 C p. 297-302
6 p.
 artikel
15 A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids Soto, José A.
 2011
 37 C p. 75-80
6 p.
 artikel
16 A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks Adasme, Pablo
 2011
 37 C p. 69-74
6 p.
 artikel
17 Bichromatic Triangle Games Manić, Gordana
 2011
 37 C p. 105-110
6 p.
 artikel
18 Characterizations of Graphs with Stretch Number less than 2 Cicerone, Serafino
 2011
 37 C p. 375-380
6 p.
 artikel
19 Clique-perfectness of complements of line graphs Bonomo, Flavia
 2011
 37 C p. 327-332
6 p.
 artikel
20 Column Generation for Extended Formulations Sadykov, Ruslan
 2011
 37 C p. 357-362
6 p.
 artikel
21 Combinatorial properties and further facets of maximum edge subgraph polytopes Marenco, Javier
 2011
 37 C p. 303-308
6 p.
 artikel
22 Comparing trees characteristic to chordal and dually chordal graphs De Caria, Pablo
 2011
 37 C p. 33-38
6 p.
 artikel
23 Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Mertzios, George B.
 2011
 37 C p. 219-224
6 p.
 artikel
24 Contracting chordal graphs and bipartite graphs to paths and trees Heggernes, Pinar
 2011
 37 C p. 87-92
6 p.
 artikel
25 Convex Recoloring of Paths Lima, Karla Roberta
 2011
 37 C p. 165-170
6 p.
 artikel
26 Counting perfect matchings in the geometric dual Jiménez, Andrea
 2011
 37 C p. 225-230
6 p.
 artikel
27 Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope Braga, Mónica
 2011
 37 C p. 213-218
6 p.
 artikel
28 Ear decompositions of join covered graphs Silveira, Luciano L.
 2011
 37 C p. 171-176
6 p.
 artikel
29 Efficient Constraint Propagation for Graph Coloring Boussemart, Frédéric
 2011
 37 C p. 243-248
6 p.
 artikel
30 Efficient Pattern Matching on Graph Patterns of Bounded Treewidth Yamada, Takashi
 2011
 37 C p. 117-122
6 p.
 artikel
31 Envy-free division of discrete cakes Marenco, Javier
 2011
 37 C p. 231-236
6 p.
 artikel
32 Finding an induced subdivision of a digraph Bang-Jensen, Jørgen
 2011
 37 C p. 9-14
6 p.
 artikel
33 Forbidden subgraphs and the Kőnig property Dourado, Mitre C.
 2011
 37 C p. 333-338
6 p.
 artikel
34 Hamiltonian Cycles in Kneser Graphs for n = 2 k + 2 Bueno, L.R.
 2011
 37 C p. 291-296
6 p.
 artikel
35 LAGOS 2011 – VI Latin-American Algorithms, Graphs, and Optimization Symposium Bonomo, Flavia
 2011
 37 C p. 1-2
2 p.
 artikel
36 Near-perfect graphs with polyhedral N + ( G ) Bianchi, Silvia M.
 2011
 37 C p. 393-398
6 p.
 artikel
37 New branch-and-bound algorithms for k-cardinality tree problems Simonetti, L.
 2011
 37 C p. 27-32
6 p.
 artikel
38 New Reoptimization Techniques applied to Steiner Tree Problem Zych, Anna
 2011
 37 C p. 387-392
6 p.
 artikel
39 Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs Alcón, Liliana
 2011
 37 C p. 81-86
6 p.
 artikel
40 On an anti-Ramsey property of random graphs Kohayakawa, Y.
 2011
 37 C p. 237-242
6 p.
 artikel
41 On Coloring Problems of Snark Families Sasaki, D.
 2011
 37 C p. 45-50
6 p.
 artikel
42 On lower bounds for the b-chromatic number of connected bipartite graphs Kouider, Mekkia
 2011
 37 C p. 399-404
6 p.
 artikel
43 On the Complexity of the Decisive Problem in Simple and Weighted Games Riquelme, Fabián
 2011
 37 C p. 21-26
6 p.
 artikel
44 On the facets of the lift-and-project relaxations of graph subdivisions Aguilera, Néstor E.
 2011
 37 C p. 201-206
6 p.
 artikel
45 On the Maximum Uniquely Restricted Matching for Bipartite Graphs Mishra, Sounaka
 2011
 37 C p. 345-350
6 p.
 artikel
46 Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs Ochem, Pascal
 2011
 37 C p. 123-128
6 p.
 artikel
47 Polyhedral results for the Equitable Coloring Problem Méndez-Diaz, I.
 2011
 37 C p. 159-164
6 p.
 artikel
48 Polynomial instances of the Packing Coloring Problem Argiroffo, G.
 2011
 37 C p. 363-368
6 p.
 artikel
49 Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs Dobson, M.P.
 2011
 37 C p. 207-212
6 p.
 artikel
50 Probe interval and probe unit interval graphs on superclasses of cographs Durán, Guillermo
 2011
 37 C p. 339-344
6 p.
 artikel
51 Reduced graphs for min-cut/max-flow approaches in image segmentation Lermé, Nicolas
 2011
 37 C p. 63-68
6 p.
 artikel
52 Restricted coloring problems on graphs with few P 4 ′ s Campos, V.
 2011
 37 C p. 57-62
6 p.
 artikel
53 Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty Lagos, Guido
 2011
 37 C p. 15-20
6 p.
 artikel
54 Selfish Square Packing Fernandes, C.G.
 2011
 37 C p. 369-374
6 p.
 artikel
55 Short coverings and matching in weighted graphs Martinhão, A.N.
 2011
 37 C p. 321-326
6 p.
 artikel
56 Solving the segmentation problem for the 2010 Argentine census with integer programming Delle Donne, Diego
 2011
 37 C p. 279-284
6 p.
 artikel
57 Some advances on Lovász-Schrijver N + ( ⋅ ) relaxations of the fractional stable set polytope Bianchi, Silvia
 2011
 37 C p. 189-194
6 p.
 artikel
58 Some Applications of the Schutzenberger-Bertoni Method Montoya, J. Andrés
 2011
 37 C p. 93-98
6 p.
 artikel
59 Some Related Functions to Integer GCD and Coprimality Sedjelmaci, Sidi Mohamed
 2011
 37 C p. 135-140
6 p.
 artikel
60 Stability in geodesics for memoryless binary long-lived consensus Fernandes, Cristina G.
 2011
 37 C p. 351-356
6 p.
 artikel
61 String graphs of k-bend paths on a grid Asinowski, Andrei
 2011
 37 C p. 141-146
6 p.
 artikel
62 Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem Pereira, Dilson Lucas
 2011
 37 C p. 315-320
6 p.
 artikel
63 Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber Pará, Telma
 2011
 37 C p. 177-182
6 p.
 artikel
64 The difference between clique graphs and iterated clique graphs De Caria, Pablo
 2011
 37 C p. 39-44
6 p.
 artikel
65 The minimum cut cover problem Hoshino, Edna A.
 2011
 37 C p. 255-260
6 p.
 artikel
66 The relative degree and large complete minors in infinite graphs Stein, Maya
 2011
 37 C p. 129-134
6 p.
 artikel
67 Two Dimensional Knapsack with Unloading Constraints da Silveira, Jefferson L.M.
 2011
 37 C p. 267-272
6 p.
 artikel
68 Two Dimensional Strip Packing with Unloading Constraints da Silveira, Jefferson L.M.
 2011
 37 C p. 99-104
6 p.
 artikel
                             68 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland