19 papers · ranked by Valyu relevance
Briański, Marcin, Lassota, Alexandra + 6 more
Solving integer programs of the form min x A x = b , l ⩽ x ⩽ u , x ∈ Z n is, in general, NP-hard. Hence, great effort has been put into identifying subclasses of integer programs that are solvable in polynomial or FPT time. A common scheme for many of these integer programs is a star-like structure of the constraint…
Hitarth, S, Mansutti, Alessio + 2 more
This paper presents the first study of the complexity of the optimization problem for integer linear-exponential programs which extend classical integer linear programs with the exponential function x 7→ 2 x and the remainder function (x, y) 7→ (x mod 2 y ). The problem of deciding if such a program has a solution was…
Akif Çördük, Piotr Sielski, Boucher, Alice + 1 more
We introduce a fusion of GPU accelerated primal heuristics for Mixed Integer Programming. Leveraging GPU acceleration enables exploration of larger search regions and faster iterations. A GPU-accelerated PDLP serves as an approximate LP solver, while a new probing cache facilitates rapid roundings and early…
Patrik Waldmann, Michael DeGiorgio
SCIP (Solving Constraint Integer Programs) is a powerful and versatile optimization solver and framework that can handle mixed integer linear programs, mixed integer quadratic programs, and general mixed integer non-linear programs with a large range of constraints (). While SCIP can be configured in many ways, its…
Frans Zdyb, Julius B. Kirkegaard
Biological image and video analysis is full of discrete decisions: whether an object is present, which multi-hypothesis detections are real, whether two detections are tracking the same object, or whether a cell divides or not. Standard pipelines resolve these locally and in sequence, e.g through non-max suppression…
Del Pia, Alberto
We introduce the notion of projection-width for systems of separable constraints, defined via branch decompositions of variables and constraints. We show that several fundamental discrete optimization and counting problems can be solved in polynomial time when the projection-width is polynomially bounded. These include…
Zhuo Dai, Yefu Zhou, Bibhas Chandra Giri
In supply chain management, the location of facilities, inventory control, and vehicle routing are three key components. This paper incorporates a two-warehouse inventory system into the location- inventory-routing problems (LIRPs) and develops LIRP models with two warehouses in one-level, two-level, and three-level…
Xinyu Gu, Stefan Ivanovic, Daniel W. Feng, Mohammed El-Kebir
Summarizing a collection P of related RNA secondary structures is a key challenge in applications like evolutionary analysis, alternative fold studies and mRNA vaccine design. This requires both clustering the input structures into similar groups and identifying the core structural motifs on which they agree or differ.…
Wei-Kun Chen, Chang-Long Li, Zhao-Wei Wang, Yu-Hong Dai + 2 more
Presolve for mixed integer programming (MIP) problems aims to eliminate redundant information, strengthen the formulation, and extract useful structural information for the subsequent branch-and-cut process. An important type of such structural information is the variable implications (VIs), which describe how a bound…
Zeynep Haber, Harun Uguz, Huseyin Hakli, AbdElRahman Ahmed ElSaid
The Artificial Bee Colony (ABC) algorithm is a simple and effective population-based optimization method, but it may exhibit unstable convergence and weak exploitation capability in discrete and highly constrained problems. This study proposes an improved ABC framework that integrates a probabilistic Uniform crossover…
Jingsi Lin, Mohammad Waqar Ali Asad, Erkan Topal, Ping Chang + 1 more
Production scheduling models for open-pit mining complexes determine the optimal sequence for extracting mining blocks while adhering to technical and operational constraints. Although various mathematical models are available in the literature, solving them for large-scale operations remains computationally intensive.…
Arseny Shur, Ido Tziony, Yaron Orenstein
Minimizers are sampling schemes which are ubiquitous in almost any high-throughput sequencing analysis. Assuming a fixed alphabet of size σ, a minimizer is defined by two positive integers k, w and a linear order ρ on k-mers. A sequence is processed by a sliding window algorithm that chooses in each window of length w…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…
Jinfeng Qiu, Liang Zhao, Xifeng Ning, Dejun Yu + 1 more
Efficient operation of natural gas pipeline networks is essential for minimizing costs and ensuring a stable energy supply. Compressor stations are critical for maintaining pressure throughout the network and represent a substantial portion of both capital investment and operational expenditures. Optimizing compressor…
Justina Senam Lotsu, Gilbert Yaw Bimpong, Kwaku Boakye
Open-pit mine production scheduling is a complex optimization problem that requires balancing economic performance with operational feasibility and environmental responsibility. While significant advances have been made in mathematical formulations, many existing approaches remain computationally demanding, lack…
A.J.R. Cotter
A simulator, ‘ECOLPS’ in R, is developed and trialed for ecological studies of closed aquatic ecosystems. Its constraint-based approach contrasts with function-based models widely applied in ecology. Total gross production (ΣGP) by ‘wild components’ (= species/life stages, grouped by ecological roles) is maximized…
Shuangyuan Shi, Chang Liu, Lvjiang Yin, Hegen Xiong + 3 more
While the static integrated process planning and scheduling (IPPS) problem is theoretically well-established, its practical application is limited in unpredictable manufacturing environments demanding dynamic adaptability. This paper proposes a dynamic IPPS problem considering stochastic rework (IPPS-SR), whose…
Authors not listed
Traditional electron-configuration notation (e.g. 1s^2 2s^2 2p^6) compresses multi-electron quantum information into integer occupancies that convey allowed maxima and most-probable arrangements but obscure the underlying probabilistic distribution and the spread of possible measurement outcomes. We present a…
Authors not listed
Continuous manufacturing processes offer significant advantages over batch processes, including easier scalability, reduced costs, lower raw material and solvent consumption, and improved energy efficiency. A robust techno-economic assessment is therefore essential to evaluate and facilitate the adoption of such…