All Stories

  1. Mathematical Formulations for Consistent Travelling Salesman Problems
  2. The Biobjective Consistent Traveling Salesman Problem
  3. Tool Switching Problems in the Context of Overlay Printing with Multiple Colours
  4. A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
  5. Designing optimal masks for a multi-object spectrometer
  6. A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints
  7. The probabilistic pickup-and-delivery travelling salesman problem
  8. Heuristic Approaches for Flight Retiming in an Integrated Airline Scheduling Problem of a Regional Carrier
  9. Optimal Solutions for the Vehicle Routing Problem with Split Demands
  10. VRP with stochastic demands and with a restocking policy
  11. Balanced Vehicle Routing: Polyhedral Analysis and Branch-and-Cut Algorithm
  12. The Periodic Vehicle Routing Problem with Driver Consistency
  13. The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time
  14. The driver and vehicle routing problem
  15. Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
  16. A Heuristic Approach to the Driver and Vehicle Routing Problem
  17. An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem
  18. An exact algorithm for a Vehicle-and-Driver Scheduling Problem
  19. Solving the Team Orienteering Arc Routing Problem with a Column Generation Approach
  20. Optimal Solutions to a Real-World Integrated Airline Scheduling Problem
  21. An Algorithmic Framework for the Exact Solution of Tree-Star Problems
  22. The connected facility location polytope
  23. The ring/κ-rings network design problem: Model and branch-and-cut algorithm
  24. Hierarchical Survivable Network Design Problems
  25. Solving the Single Vehicle Routing Problem with Variable Capacity
  26. Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
  27. A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
  28. A branch-and-cut algorithm for two-level survivable network design problems
  29. Preface
  30. Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
  31. Preface
  32. Container stacking revenue management system: A fuzzy-based strategy for Valparaiso port
  33. The split-demand one-commodity pickup-and-delivery travelling salesman problem
  34. Chapter 7: Pickup-and-Delivery Problems for People Transportation
  35. A branch-and-cut algorithm for the hub location and routing problem
  36. A MIP-based approach to solve the prize-collecting local access network design problem
  37. Single liner shipping service design
  38. Enhanced controlled tabular adjustment
  39. Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier
  40. Measuring cost efficiency in the presence of quasi-fixed inputs using dynamic Data Envelopment Analysis: The case of port infrastructure
  41. On the Asymmetric Connected Facility Location Polytope
  42. On the Asymmetric Connected Facility Location Polytope
  43. Further Developments with Perturbation Techniques to Protect Tabular Data
  44. The multi‐commodity pickup‐and‐delivery traveling salesman problem
  45. The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
  46. A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem
  47. International Network Optimization Conference, Tenerife 2013
  48. Polynomial-time separation of Enhanced Reverse Multistar inequalities
  49. A column generation approach for a school bus routing problem with resource constraints
  50. Statistical Confidentiality: Principles and Practice by George T. Duncan, Mark Elliot, Juan-José Salazar-González
  51. A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
  52. Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
  53. The Balanced Minimum Evolution Problem
  54. Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach
  55. Exact approaches to the single-source network loading problem
  56. Generalized network design polyhedra
  57. Decorous Lower Bounds for Minimum Linear Arrangement
  58. Statistical Confidentiality
  59. The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
  60. A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
  61. Disclosure Risk and Data Utility
  62. Restrictions on Data Access
  63. Thoughts on the Future
  64. Concepts of Statistical Disclosure Limitation
  65. Protecting Tabular Data
  66. Assessment of Disclosure Risk
  67. Providing and Protecting Microdata
  68. Why Statistical Confidentiality?
  69. On the Vehicle Routing Problem with lower bound capacities
  70. Lower Bounds for the Minimum Linear Arrangement of a Graph
  71. Comments on: Routing problems with loading constraints
  72. Comments on: Routing problems with loading constraints
  73. A local branching heuristic for the capacitated fixed-charge network design problem
  74. Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
  75. Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression
  76. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
  77. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
  78. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
  79. Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
  80. A new approach for data editing and imputation
  81. Statistical confidentiality: Optimization techniques to protect tables
  82. A New Lower Bound for the Minimum Linear Arrangement of a Graph
  83. On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
  84. Solving a capacitated hub location problem
  85. The Capacitatedm-Ring-Star Problem
  86. An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
  87. A branch-and-cut algorithm for the continuous error localization problem in data cleaning
  88. A heuristic approach for the continuous error localization problem in data cleaning
  89. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
  90. The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms
  91. The Generalized Traveling Salesman and Orienteering Problems
  92. Solving the asymmetric traveling purchaser problem
  93. Privacy in Statistical Databases
  94. An Iterated Local Search Heuristic for a Capacitated Hub Location Problem
  95. A New Approach to Round Tabular Data
  96. Projection results for vehicle routing
  97. Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data
  98. A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods
  99. Laying Out Sparse Graphs with Provably Minimum Bandwidth
  100. A heuristic approach for the Travelling Purchaser Problem
  101. The biobjective travelling purchaser problem
  102. Locating median cycles in networks
  103. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
  104. Mathematical models for applying cell suppression methodology in statistical data protection
  105. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
  106. A branch-and-cut algorithm for the plant-cycle location problem
  107. The Ring Star Problem: Polyhedral analysis and exact algorithm
  108. A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel
  109. Getting the Best Results in Controlled Rounding with the Least Effort
  110. Decomposition Approaches for a Capacitated Hub Problem
  111. Exact algorithms for the job sequencing and tool switching problem
  112. A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
  113. Some recent contributions to routing and location problems
  114. The Steiner cycle polytope
  115. Optimisation of the interconnecting network of a UMTS radio mobile telephone system
  116. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem
  117. Extending Cell Suppression to Protect Tabular Data against Several Attackers
  118. Solving the Cell Suppression Problem on Tabular Data with Linear Constraints
  119. Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints
  120. Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints
  121. A note on the generalized steiner tree polytope
  122. Separating lifted odd-hole inequalities to solve the index selection problem
  123. Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
  124. Solving the Orienteering Problem through Branch-and-Cut
  125. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
  126. A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location Problem
  127. The symmetric generalized traveling salesman polytope
  128. Some thoughts on combinatorial optimisation