19 papers · ranked by Valyu relevance
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…
Samar I. Farghaly, Hala M. Khayal, Ibrahim M. Algohary, Mahmoud A. Eissa + 5 more
As mobile communication systems continue to evolve to support higher data rates, ultra-low latency, and greater reliability, the effective management of Physical Cell Identities (PCI) becomes increasingly important. The pool of available identifiers is limited-504 in fourth-generation networks and 1008 in…
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.…
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…
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…
Dursun Bulutoglu
We provide a method for parallelizing the branch-and-bound with isomorphism pruning algorithm developed by Margot [Symmetric ILP: Coloring and small integers, Discrete Optimization (4) (2007), 40-62]. We apply our method to classify orthogonal arrays. For classifying all non-OD- equivalent OA(128, 9, 2, 4) and OA(144…
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…
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…
Tung Quoc Le, Anh Tuan Nguyen, Viet Anh Nguyen
Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the coupling constraints, LR enables parallel subproblem solving and often yields tighter…
Ke Chen, Abhishek Talesara, Sanchal Thakkar, Mingfu Shao
The minimum flow decomposition problem abstracts a set of key tasks in bioinformatics, including metagenome and transcriptome assembly. These tasks, collectively known as multi-assembly, aim to reconstruct multiple genomic sequences from reads obtained from mixed samples. The reads are first organized into a directed…
Xuan Lin
This paper presents a comparative study of data-driven acceleration techniques for mixed-integer bilinear programs (MIBLPs) applied to robot motion planning. MIBLPs combine discrete decision variables and nonlinear constraints, making them computationally challenging for real-time robotics applications. We investigate…
Alejandro Arenas-Vasco, Juan Carlos Rivera, Maria Gulnara Baldoquín, Yangming Zhou
This paper presents a new formulation and valid constraints for a periodic capacitated vehicle routing problem with multiple depots, heterogeneous fleet, and hard time-windows (MDHFPCVRP-TW). The problem raises from a real-world application in the vending machine industry in Medellín, Colombia. Our main contribution is…
Adilanmu Sitahong, Zheng Lu, Yiping Yuan, Peiyin Mo + 2 more
The Line Balancing Problem (LBP) is a classic optimization topic in production management, aiming to improve efficiency through task allocation. With the transformation of the manufacturing industry towards intelligence, customization, and sustainability, its research scope has been significantly expanded. This study…
Yang, Yaguang
This paper presents a Matlab implementation of an arc-search infeasible interior point algorithm for linear programming (LP), which has a proven polynomial bound of $\mathcal{O}(\sqrt{n}L)$, the best among all interior-point algorithms for LP. Software architecture and major functions are discussed. Its ease of use is…
Benjamin M. David, Paul A. Jensen
Coordinating multiple liquid handling robots is a complex logistical task when designing biological experiments. Protocol designers must consider the capabilities and constraints of each robot to distribute work optimally across multiple instruments. We developed an optimization framework that finds optimal liquid…
Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Pouya Sampourmahani, Jun-Kai You + 1 more
—The emergence of huge-scale, data-intensive linear optimization (LO) problems in applications such as machine learning has driven the need for more computationally efficient interior point methods (IPMs). While conventional IPMs are polynomial-time algorithms with rapid convergence, their periteration cost can be…
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…
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…