Tapas Das

Objective Domain Reduction for Enhancing Solver Performance on Challenging Integer Programs

  • Aadya Bhattarai
  • Lagnajita Basu
  • Tapas Das
  • Kimia Keshanian
  • Hadi Charkhgard
    • Categories Combinatorial Optimization, Integer Programming, Transportation Tags , , , ,

    In this study, we explore how the domain of objective function values for challenging integer programs can be reduced and whether such a reduction can improve the solution process. Our work is motivated by binary search, a technique that efficiently narrows a search space by repeatedly halving it through feasibility checks. Building on this idea, … Read more

    A Binary Search-Based Criterion Space Algorithm for Solving Bi-Objective Integer Programs: The Quadtree Search Method

  • Lagnajita Basu
  • Aadya Bhattarai
  • Tapas Das
  • Kimia Keshanian
  • Hadi Charkhgard
    • Categories Integer Programming, Multi-Criteria Optimization Tags , , , ,

    We propose an exact binary search-based branch-and-bound algorithm, termed the Quadtree Search Method, for solving bi-objective integer programs. The existing literature on criterion space search methods for multi-objective optimization predominantly assumes that subproblems can be solved to optimality, an assumption that becomes computationally prohibitive for hard instances. In contrast, our approach departs from this assumption … Read more