• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 2013
• 
  Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit:
  A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discret. Optim. 10(1): 25-41 (2013)
• 
  Tiru S. Arthanari:
  Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope. Discret. Optim. 10(3): 224-232 (2013)
• 
  Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine:
  A polynomial time algorithm for unloading boxes off a gravity conveyor. Discret. Optim. 10(4): 251-262 (2013)
• 
  Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries:
  Perfectness of clustered graphs. Discret. Optim. 10(4): 296-303 (2013)
• 
  Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
  One-level reformulation of the bilevel Knapsack problem using dynamic programming. Discret. Optim. 10(1): 1-10 (2013)
• 
  R. Chandrasekaran, K. Subramani:
  A combinatorial algorithm for Horn programs. Discret. Optim. 10(2): 85-101 (2013)
• 
  Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo:
  Bike sharing systems: Solving the static rebalancing problem. Discret. Optim. 10(2): 120-146 (2013)
• 
  Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
  A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10(4): 263-295 (2013)
• 
  Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
  A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. Discret. Optim. 10(1): 54-60 (2013)
• 
  Takuro Fukunaga:
  Computing minimum multiway cuts in hypergraphs. Discret. Optim. 10(4): 371-382 (2013)
• 
  Refael Hassin, Ohad Schneider:
  A local search algorithm for binary maximum 2-path partitioning. Discret. Optim. 10(4): 333-360 (2013)
• 
  Sven Herrmann, Vincent Moulton, Andreas Spillner:
  Searching for realizations of finite metric spaces in tight spans. Discret. Optim. 10(4): 310-319 (2013)
• 
  Mhand Hifi, Hedi M'Halla:
  Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. Discret. Optim. 10(4): 320-330 (2013)
• 
  Robert Hildebrand, Matthias Köppe:
  A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2^O(nlogn). Discret. Optim. 10(1): 69-84 (2013)
• 
  Imed Kacem, Vangelis Th. Paschos:
  Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discret. Optim. 10(1): 61-68 (2013)
• 
  Stefan Kratsch, Magnus Wahlström:
  Two edge modification problems without polynomial kernels. Discret. Optim. 10(3): 193-199 (2013)
• 
  Sven Oliver Krumke, Christiane Zeck:
  Generalized max flow in series-parallel graphs. Discret. Optim. 10(2): 155-162 (2013)
• 
  Asaf Levin, Aleksander Vainer:
  The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. Discret. Optim. 10(2): 147-154 (2013)
• 
  Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
  Sparse regular induced subgraphs in 2P₃-free graphs. Discret. Optim. 10(4): 304-309 (2013)
• 
  Hao-Chun Lu:
  A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions. Discret. Optim. 10(1): 11-24 (2013)
• 
  Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins:
  Branch decomposition heuristics for linear matroids. Discret. Optim. 10(2): 102-119 (2013)
• 
  Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori:
  Exact algorithms for the bin packing problem with fragile objects. Discret. Optim. 10(3): 210-223 (2013)
• 
  Kun Meng, Chuang Lin, Yang Yang:
  Minimum number of queries for an adaptive liar search game with small sets. Discret. Optim. 10(4): 233-240 (2013)
• 
  Chandrashekhar Nagarajan, David P. Williamson:
  Offline and online facility leasing. Discret. Optim. 10(4): 361-370 (2013)
• 
  Abraham P. Punnen, Santosh N. Kabadi:
  A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. Discret. Optim. 10(3): 200-209 (2013)
• 
  Christophe Rapine, Nadia Brauner:
  A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. Discret. Optim. 10(4): 241-250 (2013)
• 
  Julien Roland, José Rui Figueira, Yves De Smet:
  The inverse {0, 1}{0, 1}-knapsack problem: Theory, algorithms and computational experiments. Discret. Optim. 10(2): 181-192 (2013)
• 
  Andreas S. Schulz, Nelson A. Uhan:
  Approximating the least core value and least core of cooperative games with supermodular costs. Discret. Optim. 10(2): 163-180 (2013)
• 
  Noriyoshi Sukegawa, Atsushi Miyauchi:
  A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. 10(4): 331-332 (2013)
• 
  Yunqiang Yin, T. C. E. Cheng, Jiayin Wang, Chin-Chia Wu:
  Single-machine common due window assignment and scheduling to minimize the total cost. Discret. Optim. 10(1): 42-53 (2013)