14 papers · ranked by Valyu relevance
Timo Berthold, Peter J. Stuckey, Jakob Witzig
Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to…
Chin-Yao Chang, Eric B. Jones, Peter Gräf
—Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to solve unconstrained binary programming problems, while mixed-integer linear…
Gioni Mexi, Sébastien Designolle, Mathieu Besançon
We propose a primal heuristic for quadratic mixed-integer problems. Our method extends the Boscia framework – originally a mixedinteger convex solver leveraging a Frank-Wolfe-based branch-and-bound approach – to address nonconvex quadratic objective functions and constraints. We reformulate nonlinear constraints…
Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in…
Alexander Murray, Timm Faulwasser, Veit Hagenmeyer, Mario E. Villanueva + 1 more
'Mario E. Villanueva' 'Boris Houska'] Abstract This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming (MICP) problems to global optimality. The proposed scheme uses an iterative outer approximation method for…
Weili Zhang, Charles Nicholson
The objective scaling ensemble approach is a novel two-phase heuristic for integer linear programming problems shown to be effective on a wide variety of integer linear programming problems. The technique identifies and aggregates multiple partial solutions to modify the problem formulation and significantly reduce the…
Yongzheng Dai, Chen Chen
We develop a novel primal heuristic for nonconvex Mixed-Integer Quadratically Constrained Quadratic Programs (MIQCQPs). The method is built around a convex approximation that is dynamically adjusted within a feasibility-pump-style alternating heuristic. Approximations are adjusted based on the structure of the MIQCQP…
Henri Schmidt, Benjamin J. Raphael
Reconstructing unobserved ancestral states of a phylogenetic tree provides insight into the history of evolving systems and is one of the fundamental problems in phylogenetics. For a fixed phylogenetic tree, the most parsimonious ancestral reconstruction – a solution to the small parsimony problem – can be efficiently…
Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre
In this paper, we describe a comprehensive algorithmic framework for solving mixed integer bilevel linear optimization problems (MIBLPs) using a generalized branch-and-cut approach. The framework presented merges features from existing algorithms (for both traditional mixed integer linear optimization and MIBLPs) with…
Charlotte Merzbacher, Oisin Mac Aodha, Diego A. Oyarzún
Recent advances in synthetic biology have enabled the construction of molecular circuits that operate across multiple scales of cellular organization, such as gene regulation, signalling pathways and cellular metabolism. Computational optimization can effectively aid the design process, but current methods are…
Zixiang Xu
Gene knockout has been used to improve the conversion ratio of strains for some chemical products. Based on mixed integer bi-level linear programming (MIBLP) and cell network models, there have been several algorithms to predict the target for deletion to improve the productivity of chemicals. At present, the cell…
Josh A. Taylor, Alain Rapaport, Denis Dochain
Polyhedral models of metabolic networks are computationally tractable and can predict some cellular functions. A longstanding challenge is incorporating metabolites without losing tractability. In this paper, we do so using a new second-order cone representation of the Michaelis-Menten kinetics. The resulting model…
Shouyong Jiang, Yong Wang, Marcus Kaiser, Natalio Krasnogor
Flux balance analysis (FBA) based bilevel optimisation has been a great success in redesigning metabolic networks for biochemical overproduction. To date, many computational approaches have been developed to solve the resulting bilevel optimisation problems. However, most of them are of limited use due to biased…
Deniz Akdemir
Optimal subset selection is an important task that has numerous algorithms designed for it and has many application areas. STPGA contains a special genetic algorithm supplemented with a tabu memory property (that keeps track of previously tried solutions and their fitness for a number of iterations), and with a…