John Martinovic

Improved Flow-based Formulations for the Skiving Stock Problem

  • Maxence Delorme
  • Manuel Iori
  • John Martinovic
  • Guntram Scheithauer
  • Nico Strasdat
    • Categories (Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Combinatorial Optimization Tags , , ,

    Thanks to the rapidly advancing development of (commercial) MILP software and hardware components, pseudo-polynomial formulations have been established as a powerful tool for solving cutting and packing problems in recent years. In this paper, we focus on the one-dimensional skiving stock problem (SSP), where a given inventory of small items has to be recomposed to … Read more

    An Improved Flow-based Formulation and Reduction Principles for the Minimum Connectivity Inference Problem

  • Muhammad Abid Dar
  • Andreas Fischer
  • John Martinovic
  • Guntram Scheithauer
    • Categories Applications - Science and Engineering, Combinatorial Optimization, Integer Programming Tags , , ,

    The Minimum Connectivity Inference (MCI) problem represents an NP-hard generalisation of the well-known minimum spanning tree problem and has been studied in different fields of research independently. Let an undirected complete graph and finitely many subsets (clusters) of its vertex set be given. Then, the MCI problem is to find a minimal subset of edges … Read more