Top (journal of operations research)

• 

  Año 2012, Vol. 20, Número 1. Texto Completo Ejemplar

  • Seleccionado

    Algorithms for linear programming with linear complementarity constraints

    Joaquim J. Júdice

    • Resumen
    • Texto completo

    págs. 4-25

    
  • Seleccionado

    Comments on: Algorithms for linear programming with linear complementarity constraints 1

    Mihai Anitescu

    • Resumen
    • Texto completo

    págs. 26-27

    
  • Seleccionado

    Comments on: Algorithms for linear programming with linear complementarity constraints 2

    S. Dempe

    • Resumen
    • Texto completo

    págs. 28-29

    
  • Seleccionado

    Comments on: Algorithms for linear programming with linear complementarity constraints 3

    J.M. Martínez

    • Resumen
    • Texto completo

    págs. 30-32

    
  • Seleccionado

    Comments on: Algorithms for linear programming with linear complementarity constraints

    Hanif D. Sherali

    • Texto completo

    págs. 33-34

    
  • Seleccionado

    Unconstrained formulation of standard quadratic optimization problems

    Immanuel M. Bomze, Luigi Grippo, Laura Palagi

    • Resumen
    • Texto completo

    págs. 35-51

    
  • Seleccionado

    Enhancing discretized formulations: the knapsack reformulation and the star reformulation

    Luís Gouveia, Pedro Moura

    • Resumen
    • Texto completo

    págs. 52-74

    
  • Seleccionado

    Generalized order-value optimization

    José Mario Martínez

    • Resumen
    • Texto completo

    págs. 75-98

    
  • Seleccionado

    A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times

    Hongtao Lei, Gilbert Laporte , Bo Guo

    • Resumen
    • Texto completo

    págs. 99-118

    
  • Seleccionado

    An algorithm for semi-infinite polynomial optimization

    J.B. Lasserre

    • Resumen
    • Texto completo

    págs. 119-129

    
  • Seleccionado

    Biased random-key genetic algorithms with applications in telecommunications

    Mauricio G.C. Resende

    • Resumen
    • Texto completo

    págs. 130-153

    
  • Seleccionado

    Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints

    Satyajith Amaran, Nikolaos V. Sahinidis

    • Resumen
    • Texto completo

    págs. 154-172

    
  • Seleccionado

    Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs

    Hanif D. Sherali, J. Cole Smith

    • Resumen
    • Texto completo

    págs. 173-189

    
  • Seleccionado

    Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization

    H.A. Le Thi, A.I.F. Vaz, L.N. Vicente

    • Resumen
    • Texto completo

    págs. 190-214