[HTML][HTML] Last fifty years of integer linear programming: a focus on recent practical advances

F Clautiaux, I Ljubić - European Journal of Operational Research, 2024 - Elsevier
Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …

All-optical digital processing in Carbon Disulfide liquid-core optical fiber

N Perron, M Chemnitz, B Fischer… - 2023 Conference on …, 2023 - ieeexplore.ieee.org
We implement ultrafast, power-efficient, all-optical logic gates based on a liquid-core optical
fiber platform. We present, theoretically and experimentally, the unique nonlinear …

An Efficient Local Search Solver for Mixed Integer Programming

P Lin, M Zou, S Cai - … Conference on Principles and Practice of …, 2024 - drops.dagstuhl.de
Mixed integer programming (MIP) is a fundamental model in operations research. Local
search is a powerful method for solving hard problems, but the development of local search …

New characterizations and efficient local search for general integer linear programming

P Lin, S Cai, M Zou, J Lin - arxiv preprint arxiv:2305.00188, 2023 - arxiv.org
Integer linear programming (ILP) models a wide range of practical combinatorial
optimization problems and significantly impacts industry and management sectors. This …

State-of-the-art Methods for Pseudo-Boolean Solving with SCIP

G Mexi, D Kamp, Y Shinano, S Pu, A Hoen… - arxiv preprint arxiv …, 2025 - arxiv.org
The Pseudo-Boolean problem deals with linear or polynomial constraints with integer
coefficients over Boolean variables. The objective lies in optimizing a linear objective …

A fix-propagate-repair heuristic for mixed integer programming

D Salvagnin, R Roberti, M Fischetti - Mathematical Programming …, 2024 - Springer
We describe a diving heuristic framework based on constraint propagation for mixed integer
linear programs. The proposed approach is an extension of the common fix-and-propagate …

Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems

Y Koguma - IEEE Access, 2024 - ieeexplore.ieee.org
This paper presents a tabu search-based heuristic solver for general integer linear
programming (ILP) problems as a dependable alternative to branch-and-bound (B&B) …

ViolationLS: Constraint-Based Local Search in CP-SAT

TO Davies, F Didier, L Perron - … Conference on the Integration of Constraint …, 2024 - Springer
Abstract We introduce ViolationLS, a Constraint-Based Local Search (CBLS) solver for
arbitrary MiniZinc models based on the Feasibility Jump Mixed-Integer Programming …