Algorithms for linear programming with linear complementarity constraints
Joaquim J. Júdice
págs. 4-25
Comments on: Algorithms for linear programming with linear complementarity constraints 1
Mihai Anitescu
págs. 26-27
Comments on: Algorithms for linear programming with linear complementarity constraints 2
S. Dempe
págs. 28-29
Comments on: Algorithms for linear programming with linear complementarity constraints 3
J.M. Martínez
págs. 30-32
Comments on: Algorithms for linear programming with linear complementarity constraints
Hanif D. Sherali
págs. 33-34
Unconstrained formulation of standard quadratic optimization problems
Immanuel M. Bomze, Luigi Grippo, Laura Palagi
págs. 35-51
Enhancing discretized formulations: the knapsack reformulation and the star reformulation
Luís Gouveia, Pedro Moura
págs. 52-74
Generalized order-value optimization
José Mario Martínez
págs. 75-98
A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
Hongtao Lei, Gilbert Laporte, Bo Guo
págs. 99-118
An algorithm for semi-infinite polynomial optimization
J.B. Lasserre
págs. 119-129
Biased random-key genetic algorithms with applications in telecommunications
Mauricio G.C. Resende
págs. 130-153
Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
Satyajith Amaran, Nikolaos V. Sahinidis
págs. 154-172
Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs
Hanif D. Sherali, J. Cole Smith
págs. 173-189
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
págs. 190-214
© 2001-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: