All Stories

  1. Exact and Approximate Solving of the Aircraft Collision Resolution Problem via Turn Changes
  2. Variable Neighborhood Search strategies for the Order Batching Problem
  3. Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach
  4. A multi-stage stochastic optimization model for energy systems planning and risk management
  5. Optimization instances for deterministic and stochastic problems on energy efficient investments planning at the building level
  6. An exact multi-objective mixed integer nonlinear optimization approach for aircraft conflict resolution
  7. General Variable Neighborhood Search applied to the picking process in a warehouse
  8. Medium range optimization of copper extraction planning under uncertainty in future copper prices
  9. A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
  10. Fix-and-Relax-Coordination for a multi-period location–allocation problem under uncertainty
  11. On a selection and scheduling problem in automatic storage and retrieval warehouses
  12. A mixed 0–1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon
  13. A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
  14. Collision Avoidance in Air Traffic Management: A Mixed-Integer Linear Optimization Approach
  15. Uncertainty in Forest Production Planning
  16. Structuring Bilateral Energy Contract Portfolios in Competitive Markets
  17. VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
  18. A computational comparison of several formulations for the multi-period incremental service facility location problem
  19. Forestry management under uncertainty
  20. IWOR: tribute to Professor Laureano F. Escudero on occasion of his 65th birthday
  21. Introduction to the special issue on APMOD06
  22. BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programs
  23. On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates