All Stories

  1. Improved solution strategies for dominating trees
  2. MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
  3. Minimum Linear Arrangements
  4. Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations
  5. A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
  6. On a Traveling Salesman based Bilevel Programming Problem
  7. Minimum cost dominating tree sensor networks under probabilistic constraints
  8. New formulations for the elementary shortest-path problem visiting a given set of nodes
  9. Models for minimum cost dominating trees
  10. On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
  11. Trees and Forests
  12. A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem
  13. Stochastic maximum weight forests
  14. A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks
  15. A polynomial formulation for the stochastic maximum weight forest problem
  16. Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds
  17. Multi-service multi-facility network design under uncertainty
  18. Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models
  19. Using Lagrangian dual information to generate degree constrained spanning trees
  20. B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty
  21. Telecommunication Network Capacity Design for Uncertain Demand