• 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 32 matches

• 2013
• 
  Edoardo Amaldi, Kanika Dhyani, Leo Liberti:
  A two-phase heuristic for the bottleneck k-hyperplane clustering problem. Comput. Optim. Appl. 56(3): 619-633 (2013)
• 
  Samuel Amstutz, Antoine Laurain:
  A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints. Comput. Optim. Appl. 56(2): 369-403 (2013)
• 
  Rafael Blanquero, Emilio Carrizosa:
  Solving the median problem with continuous demand on a network. Comput. Optim. Appl. 56(3): 723-734 (2013)
• 
  Rico Buchholz, Harald Engel, Eileen Kammann, Fredi Tröltzsch:
  On the optimal control of the Schlögl-model. Comput. Optim. Appl. 56(1): 153-185 (2013)
• 
  Rico Buchholz, Harald Engel, Eileen Kammann, Fredi Tröltzsch:
  Erratum to: On the optimal control of the Schlögl-model. Comput. Optim. Appl. 56(1): 187-188 (2013)
• 
  Pierre Carpentier, Guy Cohen, Anes Dallagi:
  Particle methods for stochastic optimal control problems. Comput. Optim. Appl. 56(3): 635-674 (2013)
• 
  Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili:
  Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56(2): 405-438 (2013)
• 
  Sivashan Chetty, Aderemi Oluyinka Adewumi:
  Three new stochastic local search algorithms for continuous optimization problems. Comput. Optim. Appl. 56(3): 675-721 (2013)
• 
  Pietro Marco Congedo, Jeroen A. S. Witteveen, Gianluca Iaccarino:
  A simplex-based numerical framework for simple and efficient robust design optimization. Comput. Optim. Appl. 56(1): 231-251 (2013)
• 
  Csaba I. Fábián, Olga Papp, Krisztián Eretnek:
  Implementing the simplex method as a cutting-plane method, with a view to regularization. Comput. Optim. Appl. 56(2): 343-368 (2013)
• 
  Jinyan Fan:
  A Shamanskii-like Levenberg-Marquardt method for nonlinear equations. Comput. Optim. Appl. 56(1): 63-80 (2013)
• 
  Giovanni Fasano, Massimo Roma:
  Preconditioning Newton-Krylov methods in nonconvex large scale optimization. Comput. Optim. Appl. 56(2): 253-290 (2013)
• 
  José Rui Figueira, Luís Paquete, Marco Simões, Daniel Vanderpooten:
  Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. Comput. Optim. Appl. 56(1): 97-111 (2013)
• 
  Wei Gong, Michael Hinze:
  Error estimates for parabolic optimal control problems with control and state constraints. Comput. Optim. Appl. 56(1): 131-151 (2013)
• 
  María D. González-Lima, Aurelio R. L. Oliveira, Danilo E. Oliveira:
  A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming. Comput. Optim. Appl. 56(3): 573-597 (2013)
• 
  Warren L. Hare, Julie Nutini:
  A derivative-free approximate gradient sampling algorithm for finite minimax problems. Comput. Optim. Appl. 56(1): 1-38 (2013)
• 
  Bingsheng He, Xiaoming Yuan, Wenxing Zhang:
  A customized proximal point algorithm for convex minimization with linear constraints. Comput. Optim. Appl. 56(3): 559-572 (2013)
• 
  Kata Kiatmanaroj, Christian Artigues, Laurent Houssin, Frédéric Messine:
  Frequency assignment in a SDMA satellite communication system with beam decentring feature. Comput. Optim. Appl. 56(2): 439-455 (2013)
• 
  Peter Korosec, Jurij Silc:
  The continuous differential ant-stigmergy algorithm for numerical optimization. Comput. Optim. Appl. 56(2): 481-502 (2013)
• 
  Robert Michael Lewis, Stephen G. Nash:
  Using inexact gradients in a multilevel optimization algorithm. Comput. Optim. Appl. 56(1): 39-61 (2013)
• 
  Chengbo Li, Wotao Yin, Hong Jiang, Yin Zhang:
  An efficient augmented Lagrangian method with applications to total variation minimization. Comput. Optim. Appl. 56(3): 507-530 (2013)
• 
  Dongyi Liu, Genqi Xu:
  Symmetric Perry conjugate gradient method. Comput. Optim. Appl. 56(2): 317-341 (2013)
• 
  Ellips Masehian, Hossein Akbaripour, Nasrin Mohabbati-Kalejahi:
  Landscape analysis and efficient metaheuristics for solving the n-queens problem. Comput. Optim. Appl. 56(3): 735-764 (2013)
• 
  Mahamed G. H. Omran, Salah Al-Sharhan, Ayed A. Salman, Maurice Clerc:
  Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms. Comput. Optim. Appl. 56(2): 457-480 (2013)
• 
  Gregor Papa:
  Parameter-less algorithm for evolutionary-based optimization. Comput. Optim. Appl. 56(1): 209-229 (2013)
• 
  Blair Lennon Robertson, Christopher John Price, Marco Reale:
  CARTopt: a random search method for nonsmooth unconstrained optimization. Comput. Optim. Appl. 56(2): 291-315 (2013)
• 
  Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko:
  Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl. 56(1): 113-130 (2013)
• 
  Huixian Wu, Hezhi Luo, Xiaodong Ding, Guanting Chen:
  Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming. Comput. Optim. Appl. 56(3): 531-558 (2013)
• 
  COAP 2012 Best Paper Prize. Comput. Optim. Appl. 56(3): 503-506 (2013)
• 
  Li Yang, Bo Yu:
  A homotopy method for nonlinear semidefinite programming. Comput. Optim. Appl. 56(1): 81-96 (2013)

skipping 2 more matches