Month: May 2026

Supervised feature selection via multiobjective programming and its application in the medical field

  • Pham Thi Hoai
    • Categories Applications - OR and Management Sciences, Constrained Nonlinear Optimization, Convex and Nonsmooth Optimization, Convex Optimization, Other Topics Tags , , , ,

    In this study, we model the supervised feature selection problem using a novel approach: convex bi-objective optimization. Traditional methods have addressed this problem by maximizing relevance to class labels and minimizing redundancy among features. Recently, Wang et al. [30] formulated this problem as a single-objective convex optimization, yielding only a unique solution. Unlike that, we … Read more

    Exact Methods for Solving k-Delete Recoverable Robust 0–1 Problems Under Budgeted Uncertainty

  • Yasmine Beck
  • Christina Büsing
  • Ivana Ljubić
    • Categories (Mixed) Integer Linear Programming, Combinatorial Optimization, Robust Optimization

    We study the k-delete recoverable robust 0–1 problem in which a decision-maker solves a combinatorial optimization problem subject to objective uncertainty. The model follows a two-stage robust setup. The decision-maker first commits to an initial plan and may then revoke up to k components of this decision after the uncertainty is revealed. The underlying uncertainty … Read more

    The Distributionally Robust Cyclic Inventory Routing Problem

  • Menglei Jia
  • Albert H. Schrotenboer
  • Ahmadreza Marandi
  • chernfeng
    • Categories Production and Logistics, Supply Chain Management, Transportation Tags , , ,

    We study the cyclic inventory routing problem that involves joint decisions on vehicle routing and inventory replenishment on an infinite, cyclic horizon. It considers a single warehouse and a set of geographically dispersed retailers. We model retailer demand as random variables with uncertain distributions belonging to a moment-based ambiguity set. We develop a distributionally robust … Read more

    Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions

  • Timo Berthold
  • Dominik Kamp
  • Gioni Mexi
  • Sebastian Pokutta
  • Imre Pólik
    • Categories Global Optimization, Nonlinear Optimization

    Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern global nonlinear optimization. Starting from comparatively direct nonlinear formulations, we consider packing circles in squares and fixed-perimeter rectangles, packing circles into minimum-area ellipses, packing regular polygons into regular polygons, … Read more

    A computational comparison of handling distance constraints in MINLP

  • Christopher Hojny
  • Leo Liberti
    • Categories (Mixed) Integer Nonlinear Programming Tags , , ,

    Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening variable bounds in general MINLPs with minDCs. Because many such problems exhibit substantial symmetry, we further introduce a practical approach for handling rotation symmetries via separation … Read more

    Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach

  • Nathan Benedetto Proença
  • Marcel K. de Carli Silva
  • Levent Tunçel
    • Categories Approximation Algorithms, Optimization Software and Modeling Systems, Semi-definite Programming

    We present experimental work on a primal-dual framework simultaneously approximating maximum cut and weighted fractional cut-covering instances. In this primal-dual framework, we solve a semidefinite programming (SDP) relaxation to either the maximum cut problem or to the weighted fractional cut-covering problem, and then independently sample a collection of cuts via the random-hyperplane technique. We then … Read more