42 citations · 49 across the 5 of their papers we have counts for
5 papers
Objective Coefficient Rounding and Almost Symmetries in Binary Programs
Dominik Kuzinowicz, Paweł Lichocki, Gioni Mexi +3
This article investigates the interplay of rounding objective coefficients in binary programs and almost symmetries. Empirically, reducing the number of significant bits through ro…
Online Learning for Scheduling MIP Heuristics
Antonia Chmiela, Ambros Gleixner, Pawel Lichocki +1
Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often solve large real-world problems within minutes. This success can partially be attributed to heuristics. Sin…
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…
Solving Mixed Integer Programs Using Neural Networks
Vinod Nair, Sergey Bartunov, Felix Gimeno +16
Mixed Integer Programming (MIP) solvers rely on an array of sophisticated heuristics developed with decades of research to solve large-scale MIP instances encountered in practice.…
The hourglass and the early conservation models - co-existing evolutionary patterns in vertebrate development
Barbara Piasecka, Pawel Lichocki, Sebastien Moretti +2
Developmental constraints have been postulated to limit the space of feasible phenotypes and thus shape animal evolution. These constraints have been suggested to be the strongest…