FB Akcay

Machine-learning-enhanced strategies to generate subtour elimination constraints for the symmetric traveling salesman problem

  • FB Akcay
  • Maxence Delorme
  • Ulrich Pferschy
    • Categories Combinatorial Optimization, Integer Programming Tags , , , ,

    We present a machine learning (ML) component designed to enhance the well-known branch-and-cut (B&C) framework for the symmetric traveling salesman problem (TSP) in which only the subtour elimination constraints (SECs) violated by previously found integer solutions are considered. The objective of the ML component is to identify which SECs, from a pool of candidates, will … Read more

    Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies

  • FB Akcay
  • Maxence Delorme
    • Categories Combinatorial Optimization, Integer Programming Tags , , ,

    The parallel processor scheduling and bin packing problems with contiguity constraints are important in the field of combinatorial optimization because both problems can be used as components of effective exact decomposition approaches for several two-dimensional packing problems. In this study, we provide an extensive review of existing mathematical formulations for the two problems, together with … Read more