Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             34 results found
no title author magazine year volume issue page(s) type
1 A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives Bahiense, Laura
 2014
 164 P1 p. 34-46
13 p.
 article
2 A branch-and-cut algorithm for the latent-class logit assortment problem Méndez-Díaz, Isabel
 2014
 164 P1 p. 246-263
18 p.
 article
3 A continuous strategy to solve a class of mixed optimization problems Nascimento, Roberto Quirino do
 2014
 164 P1 p. 264-275
12 p.
 article
4 A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs Witkowski, Rafał
 2014
 164 P1 p. 349-355
7 p.
 article
5 Alternative MIP formulations for an integrated shift scheduling and task assignment problem Telhada, João
 2014
 164 P1 p. 328-343
16 p.
 article
6 A note on the Clustered Set Covering Problem Alfandari, Laurent
 2014
 164 P1 p. 13-19
7 p.
 article
7 Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times Kacem, Imed
 2014
 164 P1 p. 154-160
7 p.
 article
8 Complexity of colouring problems restricted to unichord-free and { square,unichord }-free graphs Machado, Raphael C.S.
 2014
 164 P1 p. 191-199
9 p.
 article
9 Contents 2014
 164 P1 p. v-vi
nvt p.
 article
10 Covering points with orthogonal polygons Evrendilek, Cem
 2014
 164 P1 p. 92-99
8 p.
 article
11 Earliest arrival flows in networks with multiple sinks Schmidt, Melanie
 2014
 164 P1 p. 320-327
8 p.
 article
12 Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem Gamst, Mette
 2014
 164 P1 p. 121-137
17 p.
 article
13 Exponentiality of the exchange algorithm for finding another room-partitioning Edmonds, Jack
 2014
 164 P1 p. 86-91
6 p.
 article
14 Fractional routing using pairs of failure-disjoint paths Ben-Ameur, W.
 2014
 164 P1 p. 47-60
14 p.
 article
15 Generating and counting unlabeled k -path graphs Pereira, Paulo Renato da Costa
 2014
 164 P1 p. 297-303
7 p.
 article
16 Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming Pınar, Mustafa Ç.
 2014
 164 P1 p. 304-312
9 p.
 article
17 Matching with sizes (or scheduling with processing set restrictions) Biró, Péter
 2014
 164 P1 p. 61-67
7 p.
 article
18 Maximum size of a minimum watching system and the graphs achieving the bound Auger, David
 2014
 164 P1 p. 20-33
14 p.
 article
19 Natural and extended formulations for the Time-Dependent Traveling Salesman Problem Godinho, Maria Teresa
 2014
 164 P1 p. 138-153
16 p.
 article
20 On cardinality constrained polymatroids Maurras, Jean François
 2014
 164 P1 p. 237-245
9 p.
 article
21 On Minimum Reload Cost Cycle Cover Galbiati, Giulia
 2014
 164 P1 p. 112-120
9 p.
 article
22 On the chromatic number of Toeplitz graphs Nicoloso, Sara
 2014
 164 P1 p. 286-296
11 p.
 article
23 On the linear description of the Huffman trees polytope Maurras, Jean-Francois
 2014
 164 P1 p. 225-236
12 p.
 article
24 Preface de Werra, Dominique
 2014
 164 P1 p. 1-
1 p.
 article
25 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
 164 P1 p. 200-209
10 p.
 article
26 Robust location transportation problems under uncertain demands Gabrel, V.
 2014
 164 P1 p. 100-111
12 p.
 article
27 Scheduling problem with multi-purpose parallel machines Rodrigues, Rosiane de Freitas
 2014
 164 P1 p. 313-319
7 p.
 article
28 Solving the maximum edge biclique packing problem on unbalanced bipartite graphs Acuña, V.
 2014
 164 P1 p. 2-12
11 p.
 article
29 The discrete ellipsoid covering problem: A discrete geometric programming approach do Nascimento, Roberto Quirino
 2014
 164 P1 p. 276-285
10 p.
 article
30 The location-dispatching problem: Polyhedral results and content delivery network design Chrétienne, Philippe
 2014
 164 P1 p. 68-85
18 p.
 article
31 The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm Martinez, Leonardo Conegundes
 2014
 164 P1 p. 210-224
15 p.
 article
32 The Steiner Tree Problem with Delays: A compact formulation and reduction procedures Leggieri, Valeria
 2014
 164 P1 p. 178-190
13 p.
 article
33 Unicyclic graphs of given girth k ≥ 4 having smallest general sum-connectivity index Tomescu, Ioan
 2014
 164 P1 p. 344-348
5 p.
 article
34 Using local similarity measures to efficiently address approximate graph matching Kpodjedo, Segla
 2014
 164 P1 p. 161-177
17 p.
 article
                             34 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands