3 | -- | 18 | Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick. Hierarchical cellular network design with channel allocation |
19 | -- | 33 | Ernesto G. Birgin, José Mario Martínez, Débora P. Ronconi. Optimizing the packing of cylinders into a rectangular container: A nonlinear approach |
34 | -- | 46 | Samir Elhedhli. Ranking lower bounds for the bin-packing problem |
47 | -- | 62 | Luís Gouveia, Maria João Lopes. The capacitated minimum spanning tree problem: On improved multistar constraints |
63 | -- | 71 | Youhua Frank Chen. Fractional programming approach to two stochastic inventory problems |
72 | -- | 87 | Nitin Joglekar, David N. Ford. Product development resource allocation with foresight |
88 | -- | 105 | Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau. Models for bundle trading in financial markets |
106 | -- | 120 | Sophia Daskalaki, Theodore Birbas. Efficient solutions for a university timetabling problem through integer programming |
121 | -- | 138 | Ruud Brekelmans, Lonneke Driessen, Herbert Hamers, Dick den Hertog. Constrained optimization involving expensive function evaluations: A sequential approach |
139 | -- | 153 | Maria Cândida Mourão, Lígia Amado. Heuristic method for a mixed capacitated arc routing problem: A refuse collection application |
154 | -- | 171 | Dorabela Gamboa, César Rego, Fred Glover. Data structures and ejection chains for solving large-scale traveling salesman problems |
172 | -- | 189 | Julie Hodgkin, Valerie Belton, Anastasia Koulouri. Supporting the intelligent MCDA user: A case study in multi-person multi-criteria decision support |
190 | -- | 201 | Celso M. Hino, Débora P. Ronconi, André B. Mendes. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date |
202 | -- | 217 | I. Husain, Morgan A. Hanson, Z. Jabeen. On nondifferentiable fractional minimax programming |
218 | -- | 226 | S. K. Mishra, Shouyang Wang, K. K. Lai. Nondifferentiable multiobjective programming under generalized d |
227 | -- | 231 | Igor Averbakh, Vasilij Lebedev. On the complexity of minmax regret linear programming |
232 | -- | 241 | Sanjeet Singh, Pankaj Gupta, Davinder Bhatia. Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function |
242 | -- | 251 | Masaaki Ida. Efficient solution generation for multiple objective linear programming based on extreme ray generation method |
252 | -- | 267 | Ferenc Forgó, Janos Fulop, Mária Prill. Game theoretic models for climate change negotiations |
268 | -- | 287 | Ovidiu Listes, Rommert Dekker. A stochastic approach to a case study for product recovery network design |