1 | -- | 13 | Mohsen Jahangirian, Tillal Eldabi, Aisha Naseer, Lampros K. Stergioulas, Terry Young. Simulation in manufacturing and business: A review |
14 | -- | 21 | Kostas Florios, George Mavrotas, Danae Diakoulaki. Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms |
22 | -- | 31 | Frédéric Dugardin, Farouk Yalaoui, Lionel Amodeo. New multi-objective method to solve reentrant hybrid flow shop scheduling problem |
32 | -- | 41 | Mateusz Gorczyca, Adam Janiak. Resource level minimization in the discrete-continuous scheduling |
42 | -- | 49 | Alix Munier Kordon, Djamal Rebaine. The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan |
50 | -- | 58 | M. Mekking, A. Volgenant. Solving the 2-rooted mini-max spanning forest problem by branch-and-bound |
59 | -- | 69 | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte. The Attractive Traveling Salesman Problem |
70 | -- | 80 | Haoya Chen, Youhua Frank Chen, Chun-Hung Chiu, Tsan-Ming Choi, Suresh Sethi. Coordination mechanism for the supply chain with leadtime consideration and price-dependent demand |
81 | -- | 94 | Yi-fen Su, Chyan Yang. Why are enterprise resource planning systems indispensable to supply chain management? |
95 | -- | 106 | Manoj Kumar Tiwari, N. Raghavendra, Shubham Agrawal, S. K. Goyal. A Hybrid Taguchi-Immune approach to optimize an integrated supply chain design problem with multiple shipping |
107 | -- | 117 | Srimathy Mohan, Michel Gendreau, Jean-Marc Rousseau. Heuristics for the Stochastic Eulerian Tour Problem |
118 | -- | 133 | Herbert Jodlbauer, Klaus Altendorfer. Trade-off between capacity invested and inventory needed |
134 | -- | 142 | Robert W. Grubbström. The Newsboy problem when customer demand is a compound renewal process |
143 | -- | 155 | Antonis Economou, Stella Kapodistria. Synchronized abandonments in a single server unreliable queue |
156 | -- | 165 | José Villén-Altamirano. Importance functions for restart simulation of general Jackson networks |
166 | -- | 175 | Kin Lam, Taisheng Liu, Wing-Keung Wong. A pseudo-Bayesian model in financial decision making with implications to market volatility, under- and overreaction |
176 | -- | 184 | Li-Ching Ma. Visualizing preferences on spheres for group decisions based on multiplicative preference relations |
185 | -- | 194 | Dashan Huang, Shushang Zhu, Frank J. Fabozzi, Masao Fukushima. Portfolio selection under distributional uncertainty: A relative robust CVaR approach |
195 | -- | 204 | Denis Bouyssou, Thierry Marchant. Additive conjoint measurement with ordered categories |
205 | -- | 215 | Matthew Colvin, Christos T. Maravelias. Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming |
216 | -- | 221 | Olivier Hudry. On the complexity of Slater s problems |
222 | -- | 229 | Benito A. Stradi-Granados, Emmanuel Haven. The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: The case of the IN/GB method |
230 | -- | 240 | Aliaksandr Shyshou, Irina Gribkovskaia Sr., Jaume Barceló. A simulation study of the fleet sizing problem arising in offshore anchor handling operations |
241 | -- | 250 | Zhipeng Lü, Jin-Kao Hao. A memetic algorithm for graph coloring |
251 | -- | 260 | Valtteri Ervasti, Riikka-Leena Leskelä. Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support |
261 | -- | 269 | Nuria Ramón, José L. Ruiz, Inmaculada Sirvent. A multiplier bound approach to assess relative efficiency in DEA without slacks |
270 | -- | 281 | Roberto Baldacci, Mauro Dell Amico. Heuristic algorithms for the multi-depot ring-star problem |